Vertex-arboricity of planar graphs without intersecting triangles

DOI10.1016/j.ejc.2011.09.017zbMath1250.05062OpenAlexW1965257249MaRDI QIDQ412284

Min Chen, Wei Fan Wang, Andre Raspaud

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.017

zbMATH Keywords

planar graphsvertex-arboricity

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Two sufficient conditions for a planar graph to be list vertex-2-arborable, List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles, List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles, Vertex arboricity of toroidal graphs with a forbidden cycle, An (F1,F4)‐partition of graphs with low genus and girth at least 6, On odd colorings of planar graphs, A generalization of some results on list coloring and DP-coloring, Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles, A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles, Partitioning kite‐free planar graphs into two forests, Vertex arboricity of planar graphs without intersecting 5-cycles, List vertex-arboricity of planar graphs without intersecting 5-cycles, A structural property of trees with an application to vertex-arboricity, List total arboricity of 2-degenerate graphs, A note on the list vertex arboricity of toroidal graphs, On the vertex partition of planar graphs into forests with bounded degree, An analogue of DP-coloring for variable degeneracy and its applications, Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles, Cover and variable degeneracy, Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic, An \((F_3,F_5)\)-partition of planar graphs with girth at least 5, Vertex arboricity of planar graphs without chordal 6-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• On point-linear arboricity of planar graphs
• Vertex and tree arboricities of graphs
• Parallel complexity of partitioning a planar graph into vertex-induced forests
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• B-sets and planar maps
• On the critical point-arboricity graphs
• On the linear vertex-arboricity of a planar graph
• Bounds for the vertex linear arboricity
• An inequality involving the vertex arboricity and edge arboricity of a graph
• On linear vertex‐arboricity of complementary graphs
• A Note on the Vertex Arboricity of a Graph
• Point-Arboricity and Girth
• The Point-Arboricity of Planar Graphs
• On Hamiltonian Circuits
• Acyclic colorings of planar graphs
• Acyclic colorings of planar graphs