Splitting planar graphs of girth 6 into two linear forests with short paths (Q4978291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6758793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Splitting planar graphs of girth 6 into two linear forests with short paths |
scientific article; zbMATH DE number 6758793 |
Statements
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (English)
0 references
8 August 2017
0 references
planar graph decomposition
0 references
defective coloring
0 references
fragmented coloring
0 references
path forests
0 references
2-coloring
0 references
0 references
0.9096149802207948
0 references
0.8172726035118103
0 references
0.8097594976425171
0 references
0.8071396350860596
0 references
0.8041020035743713
0 references
