An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algebraic approach for counting DP-3-colorings of sparse graphs |
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
