Partitioning a planar graph without chordal 5-cycles into two forests.

DOI10.21136/CMJ.2024.0065-23MaRDI QIDQ6584425

Yang Wang, Jiangxu Kong, Yiqiao Wang, Weifan Wang

Publication date: 7 August 2024

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

planar graphvertex-arboricityforestvertex partition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Vertex-arboricity of planar graphs without intersecting triangles
• On the vertex-arboricity of planar graphs without 7-cycles
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• B-sets and planar maps
• 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
• Partitioning kite‐free planar graphs into two forests

This page was built for publication: Partitioning a planar graph without chordal 5-cycles into two forests.

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