Coloring graphs without induced \(P_5\) or \(K_5-e\)
From MaRDI portal
Publication:6089566
DOI10.1016/j.amc.2023.128314MaRDI QIDQ6089566
Publication date: 13 November 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two complexity results for the vertex coloring problem
- Coloring the hypergraph of maximal cliques of a graph with no long path
- On (\(P_{5}\), diamond)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- 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
- A survey of χ‐boundedness
- Two cases of polynomial-time solvability for the coloring problem
- On graphs with no induced five‐vertex path or paraglider
This page was built for publication: Coloring graphs without induced \(P_5\) or \(K_5-e\)