Algorithmic bounds for the chromatic number†
From MaRDI portal
Publication:5449019
DOI10.1080/02331930701779021zbMath1133.05033OpenAlexW2015792287MaRDI QIDQ5449019
Publication date: 10 March 2008
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701779021
Cites Work
- Unnamed Item
- The strong perfect graph theorem
- Three short proofs in graph theory
- A strengthening of Brooks' theorem
- Vertex colouring and forbidden subgraphs -- a survey
- Recognizing Berge graphs
- New upper bounds for the chromatic number of a graph
- Graph Theory and Probability
- On Brooks' Theorem for Sparse Graphs
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- The smallest triangle-free 4-chromatic 4-regular graph