Guantao Chen

most citedSpanning trails with maximum degree at most 4 in

2 K_{2}

-free graphs

2 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2016★ 2 cited

Spanning trails with maximum degree at most 4 in $2 K_{2}$ -free graphs

Guantao Chen, M. N. Ellingham, Akira Saito +1

A graph is called $2 K_{2}$ -free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every $\frac{3}{2}$ -tough $2 K_{2}$ -free graph wi…

math.CO2014

Minimum degree condition for spanning generalized Halin graphs

Guantao Chen, Songling Shan, Ping Yang

A spanning tree with no vertices of degree 2 is called a Homeomorphically irreducible spanning tree\,(HIST). Based on a HIST embedded in the plane, a Halin graph is formed by conne…

math.CO2014

Characterizing forbidden pairs for hamiltonian squares

Guantao Chen, Songling Shan

The square of a graph is obtained by adding additional edges joining all pair of vertices of distance two in the original graph. Particularly, if $C$ is a hamiltonian cycle of a gr…

math.CO2014★ 1 cited

Vizing's 2-factor Conjecture Involving Large Maximum Degree

Guantao Chen, Songling Shan

Let $G$ be a connected simple graph of order $n$ and let $Δ (G)$ and $χ^{'} (G)$ denote the maximum degree and chromatic index of $G$ , respectively. Vizing proved that $χ^{'} (G) = Δ (G)$ or $…

Spanning trails with maximum degree at most 4 in 2K2​-free graphs

Minimum degree condition for spanning generalized Halin graphs

Characterizing forbidden pairs for hamiltonian squares

Vizing's 2-factor Conjecture Involving Large Maximum Degree

Spanning trails with maximum degree at most 4 in $2 K_{2}$ -free graphs