A 3-color theorem on plane graphs without 5-circuits (Q2644333): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:42, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 3-color theorem on plane graphs without 5-circuits |
scientific article |
Statements
A 3-color theorem on plane graphs without 5-circuits (English)
0 references
31 August 2007
0 references
plane graph
0 references
circuit
0 references
coloring
0 references
