Guantao Chen

activity

20142024

most citedSpanning trails with maximum degree at most 4 in

2 K_{2}

-free graphs

2 citations · 5 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2024

A short proof of the Goldberg-Seymour conjecture

Guantao Chen, Yanli Hao, Xingxing Yu +1

For a multigraph $G$ , $χ^{'} (G)$ denotes the chromatic index of $G$ , $Δ (G)$ the maximum degree of $G$ , and $Γ(G) = \max\left\{\left\lceil \frac{2|E(H)|}{|V(H)|-1} \right\rceil: H \sub…

math.CO2023★ 2 cited

Decreasing the mean subtree order by adding $k$ edges

Stijn Cambie, Guantao Chen, Yanli Hao +1

The mean subtree order of a given graph $G$ , denoted $μ (G)$ , is the average number of vertices in a subtree of $G$ . Let $G$ be a connected graph. Chin, Gordon, MacPhee, and Vincent…

math.CO2023

A note on Gupta's co-density conjecture

Guantao Chen, Songling Shan

Let $G$ be a multigraph. A subset $F$ of $E (G)$ is an edge cover of $G$ if every vertex of $G$ is incident to an edge of $F$ . The cover index, $ξ (G)$ , is the largest number of edge…

math.CO2022

Overfullness of edge-critical graphs with small minimal core degree

Yan Cao, Guantao Chen, Guangming Jing +1

Let $G$ be a simple graph. Denote by $n$ , $Δ (G)$ and $χ^{'} (G)$ be the order, the maximum degree and the chromatic index of $G$ , respectively. We call $G$ \emph{overfull} if $|E(G)|/…

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…