On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Counting Coloured Graphs. III / rank | |||
Normal rank | |||
Latest revision as of 09:01, 20 June 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
