Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
DOI10.1016/j.dam.2023.10.002OpenAlexW4387551505MaRDI QIDQ6143874
Kittikorn Nakprasit, Wipawee Tangjai, Pongpat Sittitrai, Keaitsuda Maneeruk Nakprasit
Publication date: 24 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.10.002
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9
- Planar graphs without short even cycles are near-bipartite
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
- Partitioning sparse graphs into an independent set and a forest of bounded degree
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
- Near-colorings: non-colorable graphs and NP-completeness
- On the vertex partition of planar graphs into forests with bounded degree
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- Defective 2-colorings of sparse graphs
- Planar graphs without 4, 6, 8-cycles are 3-colorable
- On the linear vertex-arboricity of a planar graph
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Improper choosability of graphs and maximum average degree
- The Point-Arboricity of Planar Graphs
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
- An (F1,F4)‐partition of graphs with low genus and girth at least 6
This page was built for publication: Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
