Acyclic and \(k\)-distance coloring of the grid (Q1014392): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Chromatic Number of Graph Powers / 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: Star coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coloring problem on the \(n\)-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of oriented graphs / rank
 
Normal rank

Revision as of 12:58, 1 July 2024

scientific article
Language Label Description Also known as
English
Acyclic and \(k\)-distance coloring of the grid
scientific article

    Statements

    Acyclic and \(k\)-distance coloring of the grid (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2009
    0 references
    0 references
    acyclic coloring
    0 references
    \(k\)-distance coloring
    0 references
    \(d\)-dimensional grids
    0 references
    hypercubes
    0 references
    graph algorithms
    0 references