Choosability of \(K_5\)-minor-free graphs (Q1584404): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über einen Satz von K.Wagner zum Vierfarbenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(98)00158-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W143450761 / rank
 
Normal rank

Latest revision as of 09:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Choosability of \(K_5\)-minor-free graphs
scientific article

    Statements

    Choosability of \(K_5\)-minor-free graphs (English)
    0 references
    0 references
    2 November 2000
    0 references
    0 references
    choosability
    0 references
    list coloring
    0 references
    0 references