Vertex-arboricity of planar graphs without intersecting triangles
From MaRDI portal
Recommendations
- On the vertex-arboricity of planar graphs
- Vertex arboricity of planar graphs without intersecting 5-cycles
- Triangle-Free Planar Graphs and Segment Intersection Graphs
- Vertex arboricity of planar graphs without chordal 6-cycles
- On the vertex-arboricity of planar graphs without 7-cycles
- A note on vertex-arboricity of plane graphs
- On some arboricities in planar graphs
- On the linear vertex-arboricity of a planar graph
- scientific article; zbMATH DE number 1500690
- List vertex-arboricity of planar graphs without intersecting 5-cycles
Cites work
- scientific article; zbMATH DE number 140103 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Note on the Vertex Arboricity of a Graph
- Acyclic colorings of planar graphs
- Acyclic colorings of planar graphs
- An inequality involving the vertex arboricity and edge arboricity of a graph
- B-sets and planar maps
- Bounds for the vertex linear arboricity
- On Hamiltonian Circuits
- On linear vertex‐arboricity of complementary graphs
- On point-linear arboricity of planar graphs
- On the critical point-arboricity graphs
- On the linear vertex-arboricity of a planar graph
- On the vertex-arboricity of planar graphs
- Parallel complexity of partitioning a planar graph into vertex-induced forests
- Point-Arboricity and Girth
- The Point-Arboricity of Planar Graphs
- The point-arboricity of a graph
- Vertex and tree arboricities of graphs
Cited in
(32)- List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles
- On the vertex-arboricity of planar graphs
- On the vertex partition of planar graphs into forests with bounded degree
- Two sufficient conditions for a planar graph to be list vertex-2-arborable
- An analogue of DP-coloring for variable degeneracy and its applications
- Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász--Plummer Conjecture on Halin Graphs
- A structural property of trees with an application to vertex-arboricity
- Partitioning kite‐free planar graphs into two forests
- Partitioning planar graph of girth 5 into two forests with maximum degree 4.
- Partitioning a planar graph without chordal 5-cycles into two forests.
- Partitioning planar graphs into bounded degree forests
- The vertex arboricity of 1-planar graphs
- On the vertex-arboricity of planar graphs without 7-cycles
- An (F1,F4)‐partition of graphs with low genus and girth at least 6
- Vertex arboricity of planar graphs without chordal 6-cycles
- A note on the list vertex-arboricity of IC-planar graphs
- List total arboricity of 2-degenerate graphs
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
- A note on the list vertex arboricity of toroidal graphs
- Cover and variable degeneracy
- Vertex arboricity of toroidal graphs with a forbidden cycle
- A generalization of some results on list coloring and DP-coloring
- Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic
- Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles
- A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
- Vertex arboricity of planar graphs without intersecting 5-cycles
- scientific article; zbMATH DE number 2217711 (Why is no real title available?)
- On odd colorings of planar graphs
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- List vertex-arboricity of planar graphs without intersecting 5-cycles
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
- scientific article; zbMATH DE number 7266381 (Why is no real title available?)
This page was built for publication: Vertex-arboricity of planar graphs without intersecting triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412284)
