Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph |
scientific article; zbMATH DE number 6352220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph |
scientific article; zbMATH DE number 6352220 |
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
0 references
0 references
0.8650028109550476
0 references
0.8176368474960327
0 references
0.8152778148651123
0 references
0.8131070137023926
0 references
0.811546802520752
0 references
