A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles

DOI10.1016/J.TCS.2020.06.009zbMATH Open1455.05016OpenAlexW3035043311MaRDI QIDQ2193274FDOQ2193274

Authors: Xuyang Cui, Wenshun Teng, Xing Liu, Huijuan Wang 

Publication date: 25 August 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.06.009

Recommendations

• On the vertex-arboricity of planar graphs
• Vertex arboricity of planar graphs without intersecting 5-cycles
• A note on vertex-arboricity of plane graphs
• On the vertex-arboricity of planar graphs without 7-cycles
• scientific article; zbMATH DE number 7266381

zbMATH Keywords

planar graphsvertex arboricityintersecting

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• The Point-Arboricity of Planar Graphs
• The point-arboricity of a graph
• On the vertex-arboricity of planar graphs without 7-cycles
• On the vertex-arboricity of planar graphs
• Vertex arboricity of toroidal graphs with a forbidden cycle
• Vertex-arboricity of planar graphs without intersecting triangles
• Vertex arboricity of planar graphs without intersecting 5-cycles
• Vertex arboricity of planar graphs without chordal 6-cycles
• On the vertex arboricity of planar graphs of diameter two
• On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2

Cited In (15)

• Planar graphs without intersecting 5-cycles are signed-4-choosable
• List injective coloring of planar graphs with disjoint \(5^-\)-cycles
• A note on global dominator coloring of graphs
• Vertex arboricity of planar graphs without intersecting 5-cycles
• On the double total dominator chromatic number of graphs
• Approximation algorithms for the submodular edge cover problem with submodular penalties
• Circular vertex arboricity
• Incidence coloring of mycielskians with fast algorithm
• Vertex arboricity of planar graphs without chordal 6-cycles
• A note on no-free-lunch theorem
• Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
• On generalized neighbor sum distinguishing index of planar graphs
• On the vertex-arboricity of planar graphs
• Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic
• Equitable vertex arboricity of planar graphs

This page was built for publication: A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles

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