A note on list improper coloring of plane graphs (Q1003695): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on list improper coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Improper Colourings of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Grötzsch-Type Theorem for List Colourings with Impropriety One / rank
 
Normal rank
Property / cites work
 
Property / cites work: List improper colorings of planar graphs with prescribed girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable / rank
 
Normal rank

Latest revision as of 03:36, 29 June 2024

scientific article
Language Label Description Also known as
English
A note on list improper coloring of plane graphs
scientific article

    Statements

    A note on list improper coloring of plane graphs (English)
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    improper choosability
    0 references
    plane graph
    0 references
    cycle
    0 references
    0 references