Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph |
scientific article |
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
