Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles

DOI10.1016/j.tcs.2022.11.007OpenAlexW4309476096MaRDI QIDQ2680856

Pongpat Sittitrai, Kittikorn Nakprasit, Watcharintorn Ruksasakchai

Publication date: 4 January 2023

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

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

zbMATH Keywords

planar grapharboricitydischarging method

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Vertex-arboricity of planar graphs without intersecting triangles
• On the vertex-arboricity of planar graphs without 7-cycles
• Planar graphs without cycles of specific lengths
• Choosability and edge choosability of planar graphs without five cycles
• Vertex arboricity of planar graphs without intersecting 5-cycles
• Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
• A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
• DP-4-colorability of planar graphs without adjacent cycles of given length
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• Vertex arboricity of planar graphs without chordal 6-cycles
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• A Note on the Vertex Arboricity of a Graph
• The Point-Arboricity of Planar Graphs