An (F₃,F₅)-partition of planar graphs with girth at least 5

DOI10.1016/J.DISC.2022.113216MaRDI QIDQ2099458zbMATH OpenOpenAlexFDO

Authors Min Chen, Weiqiang Yu, André Raspaud, Weifan Wang

Publication date 23 November 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2022.113216

zbMATH Keywords

girthplanar graphforestvertex partition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the vertex partition of planar graphs into forests with bounded degree
• Covering planar graphs with forests, one having bounded maximum degree
• Covering planar graphs with forests, one having a bounded maximum degree
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable
• Partitioning sparse graphs into an independent set and a forest of bounded degree
• Every planar graph with girth at least 5 is (1,9)-colorable
• Decomposing a planar graph of girth 5 into an independent set and a forest
• Planar graphs with girth at least 5 are \((3, 5)\)-colorable

Cites work

• scientific article; zbMATH DE number 3565019 (Why is no real title available?)
• scientific article; zbMATH DE number 1882351 (Why is no real title available?)
• (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
• A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
• Defective 2-colorings of sparse graphs
• Every planar graph with girth at least 5 is (1,9)-colorable
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Improper choosability of graphs and maximum average degree
• Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
• List improper colorings of planar graphs with prescribed girth
• Near-colorings: non-colorable graphs and NP-completeness
• On the linear vertex-arboricity of a planar graph
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
• On the vertex-arboricity of planar graphs
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable
• Planar graphs with girth at least 5 are \((3, 5)\)-colorable
• The Point-Arboricity of Planar Graphs
• Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
• Vertex-arboricity of planar graphs without intersecting triangles

Cited in

(8)

• Graphs arising from mixed partitions of \(PG(5,q)\)
• scientific article; zbMATH DE number 6125173 (Why is no real title available?)
• scientific article; zbMATH DE number 1882351 (Why is no real title available?)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
• An (F1,F4)‐partition of graphs with low genus and girth at least 6
• A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable
• On the vertex partition of planar graphs into forests with bounded degree
• A census of all 5-regular planar graphs with diameter 3.

This page was built for publication: An \((F_3,F_5)\)-partition of planar graphs with girth at least 5

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