Acyclic chromatic indices of planar graphs with large girth (Q2275931): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.03.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080754473 / 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: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of acyclic edge colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colouring of planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: About acyclic edge colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colorings of planar graphs and series parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200238 / 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: Q4542572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Edge Colouring of Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of subcubic graphs / rank
 
Normal rank

Latest revision as of 09:53, 4 July 2024

scientific article
Language Label Description Also known as
English
Acyclic chromatic indices of planar graphs with large girth
scientific article

    Statements

    Identifiers