Adapted list coloring of planar graphs (Q3652546): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20391 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4244252172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some counterexamples associated with the three-color problem / rank
 
Normal rank
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: 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: Full Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix partitions with finitely many obstructions / 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 a conjecture of B. Grünbaum / 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
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short list color proof of Grötzsch's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A not 3-choosable planar graph without 3-cycles / rank
 
Normal rank

Latest revision as of 08:08, 2 July 2024

scientific article
Language Label Description Also known as
English
Adapted list coloring of planar graphs
scientific article

    Statements

    Adapted list coloring of planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    adapted coloring
    0 references
    list coloring
    0 references
    planar graphs
    0 references
    0 references