New upper bounds for the greatest number of proper colorings of a (<i>V</i>,<i>E</i>)‐graph (Q4206761): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q126254306, #quickstatements; #temporary_batch_1719407511203 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3852212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting Coloured Graphs. III / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126254306 / rank | |||
Normal rank | |||
Latest revision as of 14:19, 26 June 2024
scientific article; zbMATH DE number 4127245
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New upper bounds for the greatest number of proper colorings of a (<i>V</i>,<i>E</i>)‐graph |
scientific article; zbMATH DE number 4127245 |
Statements
New upper bounds for the greatest number of proper colorings of a (<i>V</i>,<i>E</i>)‐graph (English)
0 references
1990
0 references
chromatic polynomial
0 references
greatest number of proper colorings
0 references
