Bounding in terms of and for some classes of graphs
From MaRDI portal
(Redirected from Publication:536214)
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
Recommendations
- On Reed's conjecture about \(\omega\), \(\Delta\) and \(\chi\)
- On bounding the difference of the maximum degree and the clique number
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- Bounding χ in terms of ω and Δ for quasi-line graphs
- An upper bound for the chromatic number of line graphs
Cites work
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 1286500 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- 25 pretty graph colouring problems
- A Note On Reed's Conjecture
- An upper bound for the chromatic number of line graphs
- Bounding χ in terms of ω and Δ for quasi-line graphs
- Graph Classes: A Survey
- Hitting all maximum cliques with a stable set using lopsided independent transversals
- On a property of the class of n-colorable graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- On the stable set problem in special \(P_{5}\)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- Stability number of bull- and chair-free graphs revisited
- The smallest triangle-free 4-chromatic 4-regular graph
- The strong perfect graph theorem
- Vertex colouring and forbidden subgraphs -- a survey
Cited in
(28)- A note on coloring vertex-transitive graphs
- On Graph Associations
- Graph coloring approach with new upper bounds for the chromatic number: team building application
- On \((\delta, \chi)\)-bounded families of graphs
- Excluding induced subdivisions of the bull and related graphs
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
- On Reed's conjecture about \(\omega\), \(\Delta\) and \(\chi\)
- A local epsilon version of Reed's conjecture
- A note on hitting maximum and maximal cliques with a stable set
- Vizing bound for the chromatic number on some graph classes
- Star chromatic bounds
- Star coloring of certain graph classes
- Proof of McDiarmid-Reed conjecture for a subclass of hexagonal graphs
- A quick way to verify if a graph is 3-colorable
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
- χ‐bounded families of oriented graphs
- A note on Reed's conjecture for triangle-free graphs
- On hitting all maximum cliques with an independent set
- A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs
- A superlocal version of Reed's conjecture
- On bounding the difference between the maximum degree and the chromatic number by a constant
- On bounding the difference of the maximum degree and the clique number
- Bounding χ in terms of ω and Δ for quasi-line graphs
- A short proof that \(\chi\) can be bounded \(\epsilon\) away from \(\Delta + 1\) toward \(\omega\)
- Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\)
- Vertex colouring and forbidden subgraphs -- a survey
- A Note On Reed's Conjecture
This page was built for publication: Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536214)
