An (F₃,F₅)-partition of planar graphs with girth at least 5
DOI10.1016/J.DISC.2022.113216OpenAlexW4307725207MaRDI QIDQ2099458FDOQ2099458
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
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
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)
Cites Work
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Title not available (Why is that?)
- The Point-Arboricity of Planar Graphs
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- List improper colorings of planar graphs with prescribed girth
- On the vertex-arboricity of planar graphs
- Vertex-arboricity of planar graphs without intersecting triangles
- Improper choosability of graphs and maximum average degree
- Defective 2-colorings of sparse graphs
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- On the linear vertex-arboricity of a planar graph
- Title not available (Why is that?)
- Near-colorings: non-colorable graphs and NP-completeness
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- Every planar graph with girth at least 5 is \((1,9)\)-colorable
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
Cited In (8)
- Graphs arising from mixed partitions of \(PG(5,q)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
