On bounding the difference of the maximum degree and the clique number
From MaRDI portal
Publication:497368
DOI10.1007/s00373-014-1468-3zbMath1321.05126arXiv1511.08403OpenAlexW2055039686MaRDI QIDQ497368
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08403
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
- The strong perfect graph theorem
- (\(\Delta-k\))-critical graphs
- Line Graphs of Helly Hypergraphs
- On Representatives of Subsets
- A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set
- A Theorem on k-Saturated Graphs
- Sur le coloriage des graphs
This page was built for publication: On bounding the difference of the maximum degree and the clique number