On \(k\)-chromatically connected graphs
type: Item
instance of: scholarly article
title: On \(k\)-chromatically connected graphs
zbMATH Open document ID: 1213.05075
author: Andrzej Dudek
author: Vojtěch Rödl
author: E. Năstase
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5648091
zbMATH Keywords: chromatic connectivity
zbMATH Keywords: Kneser graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2008.03.023
OpenAlex ID: W2039560145
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Graph Theory and Probability
cites work: The chromatic connectivity of graphs
cites work: Ramanujan graphs
cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
cites work: Q3872505
cites work: Q4870157
DOI: 10.1016/J.DISC.2008.03.023
description: scientific article; zbMATH DE number 5648091