The chromatic connectivity of graphs

DOI10.1007/BF01864163zbMath0657.05049OpenAlexW2040829539MaRDI QIDQ1110536

Jaroslav Nešetřil, Chris D. Godsil, Richard J. Nowakowski

Publication date: 1988

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01864163

zbMATH Keywords

chromatic numberchromatically k-connected graphsvertex-cutset

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (4)

Homomorphically full graphs ⋮ On tension-continuous mappings ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ On \(k\)-chromatically connected graphs

Cites Work

• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy

This page was built for publication: The chromatic connectivity of graphs