Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589): 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.ejc.2014.08.020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055259450 / rank | |||
Normal rank | |||
Revision as of 01:20, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph |
scientific article |
Statements
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (English)
0 references
8 October 2014
0 references
Steinberg's conjecture
0 references
weak Bordeaux conjecture
0 references
