-critical graphs with small high vertex cliques

From MaRDI portal
Publication:765195

DOI10.1016/J.JCTB.2011.05.003zbMATH Open1241.05036arXiv1102.1023OpenAlexW2024339209MaRDI QIDQ765195FDOQ765195


Authors: Landon Rabern Edit this on Wikidata


Publication date: 19 March 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: We prove that Kchi(G) is the only critical graph G with chi(G)geqDelta(G)geq6 and omega(mathcalH(G))leqleftlfloorfracDelta(G)2ightfloor2. Here mathcalH(G) is the subgraph of G induced on the vertices of degree at least chi(G). Setting omega(mathcalH(G))=1 proves a conjecture of Kierstead and Kostochka.


Full work available at URL: https://arxiv.org/abs/1102.1023




Recommendations




Cites Work


Cited In (9)





This page was built for publication: \(\Delta \)-critical graphs with small high vertex cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765195)