On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 12:53, 5 March 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
