An acyclic analogue to Heawood's theorem (Q4156455): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Every planar graph has an acyclic 8-coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Acyclic colorings of planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Every planar graph has an acyclic 7-coloring / rank | |||
Normal rank | |||
Latest revision as of 22:29, 12 June 2024
scientific article; zbMATH DE number 3588685
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An acyclic analogue to Heawood's theorem |
scientific article; zbMATH DE number 3588685 |
Statements
An acyclic analogue to Heawood's theorem (English)
0 references
1978
0 references
