An optimal square coloring of planar graphs (Q1928491): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: List injective colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-coloring the square of a subcubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring squares of planar graphs with girth six / 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: Choosability conjectures and multicircuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a planar cubic graph is 7-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Planar Graphs with Conditions on Girth and Distance Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: A channel assignment problem for optical networks modelled by Cayley graphs / rank
 
Normal rank

Latest revision as of 02:04, 6 July 2024

scientific article
Language Label Description Also known as
English
An optimal square coloring of planar graphs
scientific article

    Statements

    An optimal square coloring of planar graphs (English)
    0 references
    0 references
    0 references
    3 January 2013
    0 references
    0 references
    planar graphs
    0 references
    maximum degree
    0 references
    girth
    0 references
    square of a graph
    0 references
    0 references