Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7107286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph |
scientific article; zbMATH DE number 7107286 |
Statements
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (English)
0 references
19 September 2019
0 references
planar graph
0 references
bad cycles
0 references
superextension
0 references
discharging
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.91423416
0 references
0.90887094
0 references
0.9081852
0 references
0.90364033
0 references
0.90236366
0 references
0.89884883
0 references
0.8984263
0 references
0.89777696
0 references
0 references
