Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs
From MaRDI portal
Publication:6098088
DOI10.1016/j.disc.2023.113501zbMath1516.05062OpenAlexW4377018055MaRDI QIDQ6098088
No author found.
Publication date: 12 June 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113501
Cites Work
- Unnamed Item
- \(K_{4}\)-free graphs with no odd holes
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Triangle-free graphs and forbidden subgraphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Triangle-free \(2P_3\)-free graphs are 4-colorable
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- On the chromatic number of some \(P_5\)-free graphs
- On the chromatic number of (\(P_6\), diamond)-free graphs
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs
- $(2P_2,K_4)$-Free Graphs are 4-Colorable
- Colouring graphs with no induced six-vertex path or diamond