On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190130207 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034027701 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting Coloured Graphs. III / rank | |||
Normal rank | |||
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
