An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
From MaRDI portal
Publication:2099458
DOI10.1016/j.disc.2022.113216OpenAlexW4307725207MaRDI QIDQ2099458
Weiqiang Yu, Min Chen, Wei Fan Wang, Andre Raspaud
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- Vertex-arboricity of planar graphs without intersecting triangles
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- List improper colorings of planar graphs with prescribed girth
- Every planar graph with girth at least 5 is \((1,9)\)-colorable
- Near-colorings: non-colorable graphs and NP-completeness
- Planar graphs with girth at least 5 are \((3, 4)\)-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
- On the vertex-arboricity of planar graphs
- Defective 2-colorings of sparse graphs
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- On the linear vertex-arboricity of a planar graph
- 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
This page was built for publication: An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
