On the linear vertex-arboricity of a planar graph

DOI10.1002/JGT.3190140108zbMATH Open0705.05016OpenAlexW1984038535MaRDI QIDQ3484846FDOQ3484846

Authors: K. S. Poh 

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

Recommendations

• scientific article; zbMATH DE number 1299961
• scientific article; zbMATH DE number 140103
• On the vertex-arboricity of planar graphs
• On point-linear arboricity of planar graphs
• The linear 2-arboricity of planar graphs
• A result on linear arboricity of planar graphs.
• scientific article; zbMATH DE number 966822
• Linear arboricity of outer-1-planar graphs
• A note on the linear 2-arboricity of planar graphs
• The list linear arboricity of planar graphs

zbMATH Keywords

vertex linear arboricity

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Bounds for the vertex linear arboricity
• Path chromatic numbers of graphs

Cited In (56)

• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
• Partitioning planar graph of girth 5 into two forests with maximum degree 4.
• Partitioning planar graphs into bounded degree forests
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
• NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
• The vertex linear arboricity of distance graphs
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
• Maximum induced forests in graphs of bounded treewidth
• Facial incidence colorings of embedded multigraphs
• Title not available (Why is that?)
• SEFE without mapping via large induced outerplane graphs in plane graphs
• Title not available (Why is that?)
• On vertex partitions and some minor-monotone graph parameters
• Proper coloring of geometric hypergraphs
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• On the relations between arboricity and independent number or covering number
• On the minimal reducible bound for outerplanar and planar graphs
• Splitting planar graphs of girth 6 into two linear forests with short paths
• Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
• Planar Ramsey graphs
• On the vertex-arboricity of planar graphs without 7-cycles
• On point-linear arboricity of planar graphs
• Path choosability of planar graphs
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
• Monochromatic subgraphs in iterated triangulations
• Vertex-arboricity of planar graphs without intersecting triangles
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
• An (F1,F4)‐partition of graphs with low genus and girth at least 6
• Parallel complexity of partitioning a planar graph into vertex-induced forests
• A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable
• On the vertex partition of planar graphs into forests with bounded degree
• The linear arboricity of planar graphs with maximum degree at least 5
• Equitable partition of graphs into induced forests
• An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• List strong linear 2-arboricity of sparse graphs
• Channel assignment problem and relaxed 2-distant coloring of graphs
• Partitioning planar graphs with girth at least 6 into bounded size components
• Colorings of oriented planar graphs avoiding a monochromatic subgraph
• On \(S\)-packing edge-colorings of cubic graphs
• Colorings of plane graphs without long monochromatic facial paths
• Chromatic sums for colorings avoiding monochromatic subgraphs
• Bounds for the vertex linear arboricity
• Title not available (Why is that?)
• Drawing Graphs on Few Lines and Few Planes
• On Vertex Partitions and the Colin de Verdière Parameter
• The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
• A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
• Colouring planar graphs with bounded monochromatic components
• The linear \(k\)-vertex-arboricity of Halin graph
• On the vertex-arboricity of planar graphs
• On linear k-arboricity
• WORM colorings of planar graphs
• Partitioning sparse graphs into an independent set and a graph with bounded size components
• On the vertex arboricity of planar graphs of diameter two
• Path partition of planar graphs with girth at least six

This page was built for publication: On the linear vertex-arboricity of a planar graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484846)