Gang Chen

activity

20182023

collaborators

3 papers

math.CO2023

Minimizing the number of edges in $(C_{4}, K_{1, k})$ -co-critical graphs

Gang Chen, Chenchen Ren, Zi-Xia Song

Given graphs $H_{1}, H_{2}$ , a {red, blue}-coloring of the edges of a graph $G$ is a critical coloring if $G$ has neither a red $H_{1}$ nor a blue $H_{2}$ . A non-complete graph $G$ is $(H…

math.CO2021

On the size of special class 1 graphs and $(P_{3}; k)$ -co-critical graphs

Gang Chen, Zhengke Miao, Zi-Xia Song +1

A well-known theorem of Vizing states that if $G$ is a simple graph with maximum degree $Δ$ , then the chromatic index $χ^{'} (G)$ of $G$ is $Δ$ or $Δ + 1$ . A graph $G$ is class 1 if $χ'(…

math.CO2018

Planar anti-Ramsey numbers of matchings

Gang Chen, Yongxin Lan, Zi-Xia Song

Given a positive integer $n$ and a planar graph $H$ , let $T_{n} (H)$ be the family of all plane triangulations $T$ on $n$ vertices such that $T$ contains a subgraph isomorph…

Minimizing the number of edges in (C4​,K1,k​)-co-critical graphs

On the size of special class 1 graphs and (P3​;k)-co-critical graphs

Planar anti-Ramsey numbers of matchings

Minimizing the number of edges in $(C_{4}, K_{1, k})$ -co-critical graphs

On the size of special class 1 graphs and $(P_{3}; k)$ -co-critical graphs