On the chromatic number of (P5,dart)-free graphs
From MaRDI portal
(Redirected from Publication:6132236)
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₅-free graphs
Cites work
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- Graph Theory and Probability
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- Perfect divisibility and 2‐divisibility
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- The strong perfect graph theorem
- Vizing bound for the chromatic number on some graph classes
Cited in
(6)- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
- On the chromatic number of pentagon-free graphs of large minimum degree
- On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
- On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques
- On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs
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)
