Nordhaus–Gaddum‐type Theorems for decompositions into many parts (Q5711696): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Choice Numbers of Graphs: a Probabilistic Approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Short Proof of a Map-Colour Theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Six Color Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4773723 / rank | |||
Normal rank | |||
Latest revision as of 13:51, 11 June 2024
scientific article; zbMATH DE number 2236340
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nordhaus–Gaddum‐type Theorems for decompositions into many parts |
scientific article; zbMATH DE number 2236340 |
Statements
Nordhaus–Gaddum‐type Theorems for decompositions into many parts (English)
0 references
8 December 2005
0 references
chromatic number
0 references
coloring number
0 references
list chromatic number
0 references
surface embedding
0 references
