A deletion-contraction relation for the DP color function (Q2156187): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3184117261 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2107.08154 / 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: On DP-coloring of graphs and multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dissection of rectangles into squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of list‐colorings / 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: 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: A note on a Brooks' type theorem for DP‐coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2828918 / 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: Answers to two questions on the DP color function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic polynomial and list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When does the list-coloring function of a graph equal its chromatic polynomial / rank
 
Normal rank

Latest revision as of 15:17, 29 July 2024

scientific article
Language Label Description Also known as
English
A deletion-contraction relation for the DP color function
scientific article

    Statements

    A deletion-contraction relation for the DP color function (English)
    0 references
    0 references
    18 July 2022
    0 references
    graph coloring
    0 references
    list coloring
    0 references
    DP-coloring
    0 references
    chromatic polynomial
    0 references
    DP color function
    0 references

    Identifiers

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