The list 2-distance coloring of a graph with Δ(G) = 5 (Q5261051): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable / rank
 
Normal rank
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 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) / 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: Coloring the square of a \(K_{4}\)-minor free graph / rank
 
Normal rank

Revision as of 11:44, 10 July 2024

scientific article; zbMATH DE number 6454688
Language Label Description Also known as
English
The list 2-distance coloring of a graph with Δ(G) = 5
scientific article; zbMATH DE number 6454688

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references