The chromatic number of (\(P_5\), HVN)-free graphs
From MaRDI portal
Publication:6639497
DOI10.1007/s10255-024-1029-3MaRDI QIDQ6639497
Publication date: 15 November 2024
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- Ramsey-type theorems
- Paw-free graphs
- Coloring the hypergraph of maximal cliques of a graph with no long path
- On the chromatic number of \(2 K_2\)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Chromatic bounds for some classes of \(2 K_2\)-free graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- Coloring of \((P_5, 4\)-wheel)-free graphs
- On the chromatic number of some \(P_5\)-free graphs
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs
- Graph Theory and Probability
- Perfect coloring and linearly χ-boundP6-free graphs
- χ‐bounds, operations, and chords
- A survey of χ‐boundedness
- Perfect divisibility and 2‐divisibility
- Two cases of polynomial-time solvability for the coloring problem
- On graphs with no induced five‐vertex path or paraglider
- Coloring graphs with no induced five‐vertex path or gem
Related Items (1)
This page was built for publication: The chromatic number of (\(P_5\), HVN)-free graphs
