On the linear vertex-arboricity of a planar graph
From MaRDI portal
Publication:3484846
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
Cited in
(66)- On point-linear arboricity of planar graphs
- On the relations between arboricity and independent number or covering number
- Path choosability of planar graphs
- Facial incidence colorings of embedded multigraphs
- 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
- On the minimal reducible bound for outerplanar and planar graphs
- Parallel complexity of partitioning a planar graph into vertex-induced forests
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable
- Colorings of oriented planar graphs avoiding a monochromatic subgraph
- Colouring planar graphs with bounded monochromatic components
- Partitioning sparse graphs into an independent set and a graph with bounded size components
- Monochromatic subgraphs in iterated triangulations
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
- On the vertex partition of planar graphs into forests with bounded degree
- Channel assignment problem and relaxed 2-distant coloring of graphs
- Proper coloring of geometric hypergraphs
- Planar Ramsey graphs
- Equitable partition of graphs into induced forests
- On the vertex arboricity of planar graphs of diameter two
- On the vertex-arboricity of planar graphs
- Chromatic sums for colorings avoiding monochromatic subgraphs
- Colorings of plane graphs without long monochromatic facial paths
- SEFE without mapping via large induced outerplane graphs in plane graphs
- Drawing Graphs on Few Lines and Few Planes
- List strong linear 2-arboricity of sparse graphs
- On vertex partitions and some minor-monotone graph parameters
- On Vertex Partitions and the Colin de Verdière Parameter
- Bounds for the vertex linear arboricity
- Maximum induced forests in graphs of bounded treewidth
- scientific article; zbMATH DE number 140103 (Why is no real title available?)
- Vertex-arboricity of planar graphs without intersecting triangles
- scientific article; zbMATH DE number 1299961 (Why is no real title available?)
- On the vertex-arboricity of planar graphs without 7-cycles
- The hamiltonicity and path t-coloring of Sierpiński-like graphs
- The linear arboricity of planar graphs with maximum degree at least 5
- scientific article; zbMATH DE number 798637 (Why is no real title available?)
- Splitting planar graphs of girth 6 into two linear forests with short paths
- scientific article; zbMATH DE number 7266381 (Why is no real title available?)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
- The linear k-vertex-arboricity of Halin graph
- The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
- WORM colorings of planar graphs
- scientific article; zbMATH DE number 966822 (Why is no real title available?)
- Partitioning planar graphs with girth at least 6 into bounded size components
- An (F1,F4)‐partition of graphs with low genus and girth at least 6
- Path partition of planar graphs with girth at least six
- 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
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
- Partitioning planar graph of girth 5 into two forests with maximum degree 4.
- Partitioning planar graphs into bounded degree forests
- Partitioning planar graphs without 4-cycles and 6-cycles into two disjoint subcubic forests
- Sparsity-parameterised dynamic edge colouring
- An \((\mathcal{F}_2, \mathcal{F}_6)\)-partition of planar graphs without cycles of length 4 and 6
- An \((\mathcal{F}_3, \mathcal{F}_4)\)-partition of planar graphs without 4- and 6-cycles
- Decycling number of type-k Halin graphs
- On a 3-coloring of plane graphs without monochromatic facial 3-paths
- Outer-planar vertex deletion on AT-free graphs
- Defective and clustered colouring of graphs with given girth
- On partitioning a planar graph into two forests of maximum degree at most three
- On linear k-arboricity
- The vertex linear arboricity of distance graphs
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)
