Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2004.11.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033177498 / rank | |||
Normal rank | |||
Revision as of 02:22, 20 March 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
