On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.3190130207 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.3190130207 / rank | |||
Normal rank | |||
Revision as of 21:05, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the greatest number of 2 and 3 colorings of a (v, e)-graph |
scientific article |
Statements
On the greatest number of 2 and 3 colorings of a (v, e)-graph (English)
0 references
1989
0 references
chromatic polynomial
0 references
proper lambda colouring
0 references
