On \(k\)-chromatically connected graphs

DOI10.1016/j.disc.2008.03.023zbMath1213.05075OpenAlexW2039560145MaRDI QIDQ1045036

Vojtěch Rödl, Andrzej Dudek, Esmeralda L. Năstase

Publication date: 15 December 2009

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

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

zbMATH Keywords

Kneser graphschromatic connectivity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (1)

The toughness of Kneser graphs

Cites Work

• The chromatic connectivity of graphs
• Ramanujan graphs
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Graph Theory and Probability
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(k\)-chromatically connected graphs