Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56390803, #quickstatements; #temporary_batch_1711574657256
Created claim: DBLP publication ID (P1635): journals/ipl/FertinR08, #quickstatements; #temporary_batch_1731475607626
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colouring of 1-planar graphs / 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 colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic and \(k\)-distance coloring of the grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of products of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of oriented graphs / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ipl/FertinR08 / rank
 
Normal rank

Latest revision as of 07:03, 13 November 2024

scientific article
Language Label Description Also known as
English
Acyclic coloring of graphs of maximum degree five: nine colors are enough
scientific article

    Statements

    Acyclic coloring of graphs of maximum degree five: nine colors are enough (English)
    0 references
    0 references
    0 references
    24 March 2010
    0 references
    acyclic chromatic number
    0 references
    acyclic coloring algorithm
    0 references
    maximum degree 5
    0 references
    graph algorithms
    0 references

    Identifiers