Two sufficient conditions for a planar graph to be list vertex-2-arborable (Q2124649)
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: Two sufficient conditions for a planar graph to be list vertex-2-arborable |
scientific article; zbMATH DE number 7506228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two sufficient conditions for a planar graph to be list vertex-2-arborable |
scientific article; zbMATH DE number 7506228 |
Statements
Two sufficient conditions for a planar graph to be list vertex-2-arborable (English)
0 references
11 April 2022
0 references
planar graph
0 references
list vertex-arboricity
0 references
list-forested-coloring
0 references
cycle
0 references
0 references
0.8942811489105225
0 references
0.8902297616004944
0 references
0.8854712843894958
0 references
0.8824548721313477
0 references
0.8704982399940491
0 references
