The entire chromatic number of a normal graph is at most seven (Q5666578): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1171577 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: John Mitchem / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:17, 12 June 2024
scientific article; zbMATH DE number 3399267
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The entire chromatic number of a normal graph is at most seven |
scientific article; zbMATH DE number 3399267 |
Statements
The entire chromatic number of a normal graph is at most seven (English)
0 references
1972
0 references
