Color-critical graphs have logarithmic circumference (Q550393): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Long cycles in critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative lengths of paths and cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits in critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of 5- and 6-chromatic abstract graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and Circuits in Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Circuits in Critical Graphs / rank
 
Normal rank

Latest revision as of 07:12, 4 July 2024

scientific article
Language Label Description Also known as
English
Color-critical graphs have logarithmic circumference
scientific article

    Statements

    Color-critical graphs have logarithmic circumference (English)
    0 references
    0 references
    0 references
    8 July 2011
    0 references
    critical graphs
    0 references
    long cycles
    0 references
    connectivity
    0 references

    Identifiers