Minimum number of disjoint linear forests covering a planar graph (Q405685)
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: Minimum number of disjoint linear forests covering a planar graph |
scientific article; zbMATH DE number 6340725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum number of disjoint linear forests covering a planar graph |
scientific article; zbMATH DE number 6340725 |
Statements
Minimum number of disjoint linear forests covering a planar graph (English)
0 references
5 September 2014
0 references
planar graph
0 references
linear forest
0 references
cycle
0 references
covering
0 references
0 references
0.8935001492500305
0 references
0.8908200263977051
0 references
0.8314959406852722
0 references
0.8150174021720886
0 references
0.7990294694900513
0 references
