Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.endm.2009.07.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076500039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic list 7‐coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 5-choosability of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acyclic choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:22, 6 July 2024

scientific article
Language Label Description Also known as
English
Acyclic choosability of planar graphs: a Steinberg like approach
scientific article

    Statements

    Acyclic choosability of planar graphs: a Steinberg like approach (English)
    0 references
    0 references
    0 references
    10 October 2013
    0 references
    acyclic choosability
    0 references
    planar graphs
    0 references
    forbidden cycles
    0 references
    list coloring
    0 references
    list assignment
    0 references

    Identifiers