Jianhua Yin

collaborators

2 papers

math.CO2019

A Pósa-type condition of potentially $_{3} C_{ℓ}$ -graphic sequences

Guang-Ming Li, Jian-Hua Yin

A non-increasing sequence $π = (d_{1}, \dots, d_{n})$ of nonnegative integers is said to be graphic if it is realizable by a simple graph $G$ on $n$ vertices. A graphic sequence $π=(d_1,\…

math.CO2018

Exact solution to an extremal problem on graphic sequences with a realization containing every $2$ -tree on $k$ vertices

De-Yan Zeng, Dong-Yang Zhai, Jian-Hua Yin

A simple graph $G$ is an {\it 2-tree} if $G = K_{3}$ , or $G$ has a vertex $v$ of degree 2, whose neighbors are adjacent, and $G - v$ is an 2-tree. Clearly, if $G$ is an 2-tree on $n$ ver…

A Pósa-type condition of potentially 3​Cℓ​-graphic sequences

Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on k vertices

A Pósa-type condition of potentially $_{3} C_{ℓ}$ -graphic sequences

Exact solution to an extremal problem on graphic sequences with a realization containing every $2$ -tree on $k$ vertices