Adaptable choosability of planar graphs with sparse short cycles (Q1045097): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the upper chromatic numbers of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey properties of orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3475303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph colouring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split and balanced colorings of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapted list coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic capacities of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adaptable chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapted List Coloring of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on adaptable choosability of graphs / rank
 
Normal rank

Latest revision as of 07:54, 2 July 2024

scientific article
Language Label Description Also known as
English
Adaptable choosability of planar graphs with sparse short cycles
scientific article

    Statements

    Adaptable choosability of planar graphs with sparse short cycles (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    adapted colouring
    0 references
    list colouring
    0 references
    planar graphs
    0 references
    0 references