Yian Xu

most citedThe chromatic number of heptagraphs

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

collaborators

4 papers

math.CO2022★ 1 cited

The chromatic number of ( $P_{5}, K_{5} - e$ )-free graphs

Yian Xu

Let $G$ be a graph. We use $χ (G)$ and $ω (G)$ to denote the chromatic number and clique number of $G$ respectively. A $P_{5}$ is a path on 5 vertices. A family of graphs $G$ …

math.CO2022★ 2 cited

The chromatic number of heptagraphs

Wu Di, Baogang Xu, Yian Xu

A hole is an induced cycle of length at least 4. A graph is called a pentagraph if it has no cycles of length 3 or 4 and has no holes of odd length at least 7, and is called a hept…

math.CO2022

A tight linear bound to the chromatic number of $(P_{5}, K_{1} + (K_{1} \cup K_{3}))$ -free graphs

Wei Dong, Baogang Xu, Yian Xu

Let $F_{1}$ and $F_{2}$ be two disjoint graphs. The union $F_{1} \cup F_{2}$ is a graph with vertex set $V (F_{1}) \cup V (F_{2})$ and edge set $E (F_{1}) \cup E (F_{2})$ , and the join $F_{1} + F_{2}$ is a gra…

math.CO2022

The chromatic number of (P_5, HVN )-free graphs

Yian Xu

Let $G$ be a graph. We use $χ (G)$ and $ω (G)$ to denote the chromatic number and clique number of $G$ respectively. A $P_{5}$ is a path on 5 vertices, and an $H V N$ is a $K_{4}$ together…

The chromatic number of (P5​,K5​−e)-free graphs

The chromatic number of heptagraphs

A tight linear bound to the chromatic number of (P5​,K1​+(K1​∪K3​))-free graphs

The chromatic number of (P_5, HVN )-free graphs

The chromatic number of ( $P_{5}, K_{5} - e$ )-free graphs

A tight linear bound to the chromatic number of $(P_{5}, K_{1} + (K_{1} \cup K_{3}))$ -free graphs