Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable |
scientific article |
Statements
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (English)
0 references
18 December 2009
0 references
graph covering
0 references
induced subgraphs
0 references
list coloring
0 references
point arboricity
0 references
0 references
