• Corpus ID: 248157444

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

@inproceedings{Xu2022TheCN,
  title={The chromatic number of (P\_5, HVN )-free graphs},
  author={Yian Xu},
  year={2022}
}
  • Yian Xu
  • Published 13 April 2022
  • Mathematics
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 HV N is a K 4 together with one more vertex which is adjacent to exactly two vertices of K 4 . In this paper, we show that if G is ( P 5 , HVN )-free, then χ ( G ) ≤ ω ( G ) + 3. This generalizes some results on χ -bounded problem of P 5 -free graphs, and this upper bound is almost sharp as there are many ( P 5 , K 4 )-free graphs with chromatic… 
7 Citations

Figures from this paper

A tight linear bound to the chromatic number of $(P_5, K_1+(K_1\cup K_3))$-free graphs
Let F 1 and F 2 be two disjoint graphs. The union F 1 ∪ F 2 is a graph with vertex set V ( F 1 ) ∪ V ( F 2 ) and edge set E ( F 1 ) ∪ E ( F 2 ), and the join F 1 + F 2 is a graph with vertex set V (
Graphs of large chromatic number
The chromatic number has been a fundamental topic of study in graph theory for more than 150 years. Graph colouring has a deep combinatorial theory and, as with many NP-hard problems, is of interest
k-Critical Graphs in P5-Free Graphs
TLDR
To obtain the complete dichotomy, the finiteness for four new graphs $H$ is proved using various techniques -- such as Ramsey-type arguments and the dual of Dilworth's Theorem -- that may be of independent interest.
Homogeneous sets, clique-separators, critical graphs, and optimal $\chi$-binding functions
Given a set $\mathcal{H}$ of graphs, let $f_\mathcal{H}^\star\colon \mathbb{N}_{>0}\to \mathbb{N}_{>0}$ be the optimal $\chi$-binding function of the class of $\mathcal{H}$-free graphs, that is,

References

SHOWING 1-10 OF 37 REFERENCES
Subtrees of a graph and the chromatic number. In The theory and applications of graphs (Kalamazoo
  • 1980
On graphs with no induced five‐vertex path or paraglider
TLDR
The structure of ($P_5, paraglider)-free graphs is studied, and it is shown that every such graph $G$ satisfies $\chi(G)\le \lceil \frac{3}{2}\omega(G) \rceil$, where $\chi (G)$ and $\omega$ are the chromatic number and clique number of $G$, respectively.
The chromatic number of {P5, K4}-free graphs
A tight linear bound to the chromatic number of $(P_5, K_1+(K_1\cup K_3))$-free graphs
Let F 1 and F 2 be two disjoint graphs. The union F 1 ∪ F 2 is a graph with vertex set V ( F 1 ) ∪ V ( F 2 ) and edge set E ( F 1 ) ∪ E ( F 2 ), and the join F 1 + F 2 is a graph with vertex set V (
On the chromatic number of a family of odd hole free graphs
TLDR
It is proved that for (odd hole, full house)-free graph G, χ(G) ≤ ω(G)+ 1, and the equality holds if and only if ω (G) = 3 and G has H as an induced subgraph.
Coloring of (P5, 4-wheel)-free graphs
Perfect coloring and linearly χ-bound P 6 -free graphs
We derive decomposition theorems for P6, K1 + P4-free graphs, P5, K1 + P4-free graphs and P5, K1 + C4-free graphs, and deduce linear χ-binding functions for these classes of graphs (here, Pn (Cn)
Problems from the world surrounding perfect graphs
Polynomial $$\chi $$χ-Binding Functions and Forbidden Induced Subgraphs: A Survey
TLDR
This paper addresses perfect graphs, hereditary graphs satisfying the Vizing bound, graphs having linear χ-binding functions and graphs having non-linear polynomial functions, and graph classes defined in terms of forbidden induced subgraphs.
...
...