On \(k\)-chromatically connected graphs (Q1045036): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870157 / rank
 
Normal rank

Latest revision as of 07:53, 2 July 2024

scientific article
Language Label Description Also known as
English
On \(k\)-chromatically connected graphs
scientific article

    Statements

    On \(k\)-chromatically connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    chromatic connectivity
    0 references
    Kneser graphs
    0 references
    0 references