An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.ejc.2023.103890 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.EJC.2023.103890 / rank | |||
Normal rank |
Latest revision as of 19:25, 30 December 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
26 March 2024
0 references
correspondence coloring
0 references
chromatic polynomial
0 references
0 references