A weak DP-coloring of planar graphs without 4- and 9-cycles (Q6184347): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On DP-coloring of graphs and multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed DP-3-coloring of planar graphs without some cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective DP-colorings of sparse multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective DP-colorings of sparse simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-defective DP-colorings of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of planar graphs with forbidden configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: DP-3-coloring of some planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: DP-3-coloring of planar graphs without certain cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions on planar graphs to have a relaxed DP-3-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable / rank
 
Normal rank

Revision as of 20:34, 23 August 2024

scientific article; zbMATH DE number 7794348
Language Label Description Also known as
English
A weak DP-coloring of planar graphs without 4- and 9-cycles
scientific article; zbMATH DE number 7794348

    Statements

    A weak DP-coloring of planar graphs without 4- and 9-cycles (English)
    0 references
    0 references
    0 references
    24 January 2024
    0 references
    weak DP-coloring
    0 references
    defective coloring
    0 references
    vertex-partition
    0 references
    discharging method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references