List-coloring graphs without \(K_{4,k}\)-minors (Q1028458): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.08.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081099898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / 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: Linear connectivity forces large complete bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex partitions of \(K_{4,4}\)-minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results for rooted minor problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted minor problems in highly connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed Hadwiger's conjecture for list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing unbalanced complete bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(K_{s,t}\)-minors in graphs with given average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for unbalanced bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for noncomplete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IX: Disjoint crossed paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal functions for rooted minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective choosability of graphs with no edge-plus-independent-set minor / rank
 
Normal rank

Latest revision as of 18:16, 1 July 2024

scientific article
Language Label Description Also known as
English
List-coloring graphs without \(K_{4,k}\)-minors
scientific article

    Statements

    List-coloring graphs without \(K_{4,k}\)-minors (English)
    0 references
    30 June 2009
    0 references
    0 references
    list-coloring
    0 references
    Hadwiger's conjecture
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references