On the linear vertex-arboricity of a planar graph
From MaRDI portal
Publication:3484846
DOI10.1002/jgt.3190140108zbMath0705.05016OpenAlexW1984038535MaRDI QIDQ3484846
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140108
Related Items (45)
The vertex linear arboricity of distance graphs ⋮ Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ Path choosability of planar graphs ⋮ Facial incidence colorings of embedded multigraphs ⋮ A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable ⋮ On the vertex arboricity of planar graphs of diameter two ⋮ Colorings of oriented planar graphs avoiding a monochromatic subgraph ⋮ Colorings of plane graphs without long monochromatic facial paths ⋮ On the minimal reducible bound for outerplanar and planar graphs ⋮ Parallel complexity of partitioning a planar graph into vertex-induced forests ⋮ Colouring planar graphs with bounded monochromatic components ⋮ Partitioning sparse graphs into an independent set and a graph with bounded size components ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ An (F1,F4)‐partition of graphs with low genus and girth at least 6 ⋮ Path partition of planar graphs with girth at least six ⋮ Vertex-arboricity of planar graphs without intersecting triangles ⋮ NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition ⋮ On the vertex-arboricity of planar graphs ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Unnamed Item ⋮ On the vertex-arboricity of planar graphs without 7-cycles ⋮ The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs ⋮ Monochromatic subgraphs in iterated triangulations ⋮ Partitioning a triangle-free planar graph into a forest and a forest of bounded degree ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests ⋮ A lower bound on the order of the largest induced linear forest in triangle-free planar graphs ⋮ On \(S\)-packing edge-colorings of cubic graphs ⋮ List strong linear 2-arboricity of sparse graphs ⋮ WORM colorings of planar graphs ⋮ On vertex partitions and some minor-monotone graph parameters ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ On the vertex partition of planar graphs into forests with bounded degree ⋮ SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ On the relations between arboricity and independent number or covering number ⋮ Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths ⋮ Proper coloring of geometric hypergraphs ⋮ Planar Ramsey graphs ⋮ An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 ⋮ Equitable partition of graphs into induced forests ⋮ On Vertex Partitions and the Colin de Verdière Parameter ⋮ An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem ⋮ Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
Cites Work
This page was built for publication: On the linear vertex-arboricity of a planar graph
