Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jctb.2004.11.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCTB.2004.11.001 / rank | |||
Normal rank | |||
Latest revision as of 10:50, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without cycles of length from 4 to 7 are 3-colorable |
scientific article |
Statements
Planar graphs without cycles of length from 4 to 7 are 3-colorable (English)
0 references
8 March 2005
0 references
Planar graphs
0 references
3-coloring
0 references
Steinberg's conjecture
0 references
0 references
