Guantao Chen

activity

19982026

most citedNonempty Intersection of Longest Paths in Series-Parallel Graphs

33 citations · 69 across the 38 of their papers we have counts for

collaborators

Showing 2020Show all

5 papers · 1 filter

math.CO2020

Overfullness of critical class 2 graphs with a small core degree

Yan Cao, Guantao Chen, Songling Shan

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

math.CO2020★ 6 cited

Improved bounds on the Ramsey number of fans

Guantao Chen, Xiaowei Yu, Yi Zhao

For a given graph $H$ , the Ramsey number $r (H)$ is the minimum $N$ such that any 2-edge-coloring of the complete graph $K_{N}$ yields a monochromatic copy of $H$ . Given a positive in…

math.CO2020

$Δ$ -critical graphs with a vertex of degree 2

Yan Cao, Guantao Chen, Songling Shan

Let $G$ be a simple graph with maximum degree $Δ$ . A classic result of Vizing shows that $χ^{'} (G)$ , the chromatic index of $G$ , is either $Δ$ or $Δ + 1$ . We say $G$ is of \emph{Class 1…

math.CO2020★ 3 cited

Proof of the Core Conjecture of Hilton and Zhao

Yan Cao, Guantao Chen, Guangming Jing +1

Let $G$ be a simple graph with maximum degree $Δ$ . We call $G$ \emph{overfull} if $∣ E (G) ∣ > Δ ⌊ ∣ V (G) ∣/2 ⌋$ . The \emph{core} of $G$ , denoted $G_{Δ}$ , is the subgraph of $G$ i…

math.CO2020

Laminar Tight Cuts in Matching Covered Graphs

Guantao Chen, Xing Feng, Fuliang Lu +2

An edge cut $C$ of a graph $G$ is {\it tight} if $∣ C \cap M ∣ = 1$ for every perfect matching $M$ of $G$ .~Barrier cuts and 2-separation cuts are called {\it ELP-cuts}, which are two i…

Overfullness of critical class 2 graphs with a small core degree

Improved bounds on the Ramsey number of fans

Δ-critical graphs with a vertex of degree 2

Proof of the Core Conjecture of Hilton and Zhao

Laminar Tight Cuts in Matching Covered Graphs

$Δ$ -critical graphs with a vertex of degree 2