On the chromatic number of (P5,dart)-free graphs
From MaRDI portal
Publication:6132236
DOI10.1142/S1793830922500902zbMATH Open1517.05062OpenAlexW4224013327MaRDI QIDQ6132236FDOQ6132236
Publication date: 14 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500902
Recommendations
- On the chromatic number of some \(P_5\)-free graphs
- On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques
- A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
- On the chromatic number of pentagon-free graphs of large minimum degree
- On the chromatic number of (P_{5},windmill)-free graphs
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- A Note on k-Colorability of P 5-Free Graphs
- On 3-colorable \(P_5\)-free graphs
Cites Work
- Graph Theory and Probability
- Title not available (Why is that?)
- The strong perfect graph theorem
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- Title not available (Why is that?)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Vizing bound for the chromatic number on some graph classes
- Perfect divisibility and 2‐divisibility
Cited In (4)
This page was built for publication: On the chromatic number of (P5,dart)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132236)
