Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.1016/j.disc.2012.07.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964561990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph has an acyclic 7-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 3-choosability of sparse graphs with girth at least 7 / 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: Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 5-choosability of planar graphs without adjacent short cycles / 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: Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Colourings of Planar Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic 4-choosability of planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for planar graphs to be acyclically 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable / 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: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note to the paper of Grünbaum on acyclic colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph has an acyclic 8-coloring / 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: Acyclic 5-choosability of planar graphs without small cycles / 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
Property / cites work
 
Property / cites work: Planar graphs without 4-cycles are acyclically 6-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles / rank
 
Normal rank

Latest revision as of 20:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Acyclic 4-choosability of planar graphs without adjacent short cycles
scientific article

    Statements

    Acyclic 4-choosability of planar graphs without adjacent short cycles (English)
    0 references
    0 references
    0 references
    26 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graph
    0 references
    acyclic coloring
    0 references
    choosability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references