Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:27, 30 January 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
