Note on robust critical graphs with large odd girth

DOI10.1016/j.disc.2009.03.030zbMath1215.05072OpenAlexW2103651902MaRDI QIDQ960960

Vojtěch Rödl, Mark H. Siggers, Esmeralda L. Năstase

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.030

zbMATH Keywords

graphodd girthcolour critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (1)

Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)

Cites Work

• Subgraphs of colour-critical graphs
• On colorings of graphs without short cycles
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Graph Theory and Probability
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• On a problem of K. Zarankiewicz
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on robust critical graphs with large odd girth