Partial DP-coloring of graphs (Q2659213): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The chromatic difference sequence of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic behavior of the correspondence chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johansson‐Molloy theorem for DP‐coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Dirac's theorem for DP‐critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DP-colorings of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On DP-coloring of graphs and multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DP-colorings of graphs with high chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds For Induced Forests in Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719327 / 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: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Partial List Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial list colouring of certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz and DP-coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic polynomial and counting DP-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum size of feedback vertex sets of planar graphs of girth at least five / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a Brooks' type theorem for DP‐coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for DP-4-colorability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable / 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: A note on the DP-chromatic number of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum induced forests of a connected cubic graph without triangles / rank
 
Normal rank

Latest revision as of 21:28, 24 July 2024

scientific article
Language Label Description Also known as
English
Partial DP-coloring of graphs
scientific article

    Statements

    Partial DP-coloring of graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2021
    0 references
    graph coloring
    0 references
    list coloring
    0 references
    partial list coloring
    0 references
    DP-coloring
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers