Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048)
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 with girth at least 8 into a forest and a matching |
scientific article; zbMATH DE number 5886369
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing a planar graph with girth at least 8 into a forest and a matching |
scientific article; zbMATH DE number 5886369 |
Statements
Decomposing a planar graph with girth at least 8 into a forest and a matching (English)
0 references
10 May 2011
0 references
planar graph
0 references
decomposing
0 references
girth
0 references
forest
0 references
matching
0 references
0.9366847
0 references
0.9287461
0 references
0.9134562
0 references
0.89566994
0 references
0.8931779
0 references
0.8913721
0 references
0.87541723
0 references
0.87375057
0 references
