Partitioning a planar graph without chordal 5-cycles into two forests. (Q6584425)
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: Partitioning a planar graph without chordal 5-cycles into two forests. |
scientific article; zbMATH DE number 7893387
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a planar graph without chordal 5-cycles into two forests. |
scientific article; zbMATH DE number 7893387 |
Statements
Partitioning a planar graph without chordal 5-cycles into two forests. (English)
0 references
7 August 2024
0 references
planar graph
0 references
vertex-arboricity
0 references
forest
0 references
vertex partition
0 references
