Reducing Hajós' 4-coloring conjecture to 4-connected graphs (Q2496200): 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.2005.10.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072648209 / rank | |||
Normal rank | |||
Revision as of 19:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing Hajós' 4-coloring conjecture to 4-connected graphs |
scientific article |
Statements
Reducing Hajós' 4-coloring conjecture to 4-connected graphs (English)
0 references
12 July 2006
0 references
coloring
0 references
\(K_{5}\)-subdivision
0 references
connectivity
0 references
cycle
0 references
