2-distance list \((\varDelta +3)\)-coloring of sparse graphs (Q2084788): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The list 2-distance coloring of a graph with Δ(G) = 5 / 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: List Colouring Squares of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5552096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a \(K_{4}\)-minor free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a planar cubic graph is 7-colorable / rank
 
Normal rank

Latest revision as of 10:00, 30 July 2024

scientific article
Language Label Description Also known as
English
2-distance list \((\varDelta +3)\)-coloring of sparse graphs
scientific article

    Statements

    2-distance list \((\varDelta +3)\)-coloring of sparse graphs (English)
    0 references
    0 references
    13 October 2022
    0 references
    2-distance coloring
    0 references
    square coloring
    0 references
    sparse graphs
    0 references
    discharging method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references