Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph (Q6584736)
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 planar graphs without triangular short cycles into a matching and a 3-colorable graph |
scientific article; zbMATH DE number 7893836
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph |
scientific article; zbMATH DE number 7893836 |
Statements
Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph (English)
0 references
8 August 2024
0 references
planar graphs
0 references
bad cycles
0 references
bad partition
0 references
superextension
0 references
0 references
0 references
0 references
0 references
0 references
