The thickness and chromatic number of \(r\)-inflated graphs (Q709322): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4111609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the four color theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-extremal graphs and the lexicographic product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a special case of Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3261867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Hajós' conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Non-Biplanar Character of the Complete 9-Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5311854 / rank
 
Normal rank

Latest revision as of 09:00, 3 July 2024

scientific article
Language Label Description Also known as
English
The thickness and chromatic number of \(r\)-inflated graphs
scientific article

    Statements

    The thickness and chromatic number of \(r\)-inflated graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2010
    0 references
    0 references
    graph coloring
    0 references
    chromatic number
    0 references
    thickness
    0 references
    \(r\)-inflation
    0 references
    independence number
    0 references
    arboricity
    0 references
    0 references