Minimum number of disjoint linear forests covering a planar graph (Q405685): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Hui-Juan Wang / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6340725 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graph | |||
| Property / zbMATH Keywords: planar graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
linear forest | |||
| Property / zbMATH Keywords: linear forest / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cycle | |||
| Property / zbMATH Keywords: cycle / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
covering | |||
| Property / zbMATH Keywords: covering / rank | |||
Normal rank | |||
Revision as of 17:24, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum number of disjoint linear forests covering a planar graph |
scientific article |
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
