An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Covering the cube by affine hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DP color function of joins and vertex-gluings of graphs / 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: Graph polynomials and group coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-chromatic-adherence of the DP color function via generalized theta graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DP color functions versus chromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) / 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: DP‐coloring Cartesian products 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: 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: A deletion-contraction relation for the DP color function / 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: Many 3-colorings of triangle-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic polynomial and list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699709 / 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

Revision as of 17:02, 28 August 2024

scientific article; zbMATH DE number 7824132
Language Label Description Also known as
English
An algebraic approach for counting DP-3-colorings of sparse graphs
scientific article; zbMATH DE number 7824132

    Statements

    An algebraic approach for counting DP-3-colorings of sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    26 March 2024
    0 references
    correspondence coloring
    0 references
    chromatic polynomial
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references