An (F₃,F₅)-partition of planar graphs with girth at least 5
For classes of graphs \(\mathcal{C}_1, \mathcal{C}_2,\dots, \mathcal{C}_k\), a \((\mathcal{C}_1, \mathcal{C}_2,\dots, \mathcal{C}_k)\)-partition of a graph \(G\) is a partition \((V_1, V_2,\dots, V_k)\) of \(V(G)\) with \(G[V_i]\in\mathcal{C}_i\) for each \(i\), \(1\le i\le k\). It is a generalization of a traditional vertex-coloring of a graph. Actually, for a non-negative integer \(d\), let \(\Delta_d\) denote the class of graphs of maximum degree at most \(d\). Then a \(k\)-coloring is a \((\mathcal{C}_1, \mathcal{C}_2, \dots, \mathcal{C}_k)\)-partition with \(\mathcal{C}_1 = \mathcal{C}_2 =\dots =\mathcal{C}_k=\Delta_0\). In particular, The Four Color Theorem states that every planar graph admits a \((\Delta_0, \Delta_0, \Delta_0, \Delta_0)\)-partition. \textit{I. Choi} and \textit{A. Raspaud} [ibid. 338, No. 4, 661--667 (2015; Zbl 1305.05072)] proved that every planar graph of girth at least~\(5\) admits a \((\Delta_3, \Delta_5)\)-partition. In this paper, the authors strengthen this result and prove that every planar graph of girth at least~\(5\) admits an \((F_3, F_5)\)-partition, where \(F_d\) is the class of forests of maximum degree at most \(d\).
- 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
- (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
- scientific article; zbMATH DE number 3565019 (Why is no real title available?)
- scientific article; zbMATH DE number 1882351 (Why is no real title available?)
- 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
- 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
- Graphs arising from mixed partitions of PG(5,q)
- A census of all 5-regular planar graphs with diameter 3.
- scientific article; zbMATH DE number 1882351 (Why is no real title available?)
- scientific article; zbMATH DE number 6125173 (Why is no real title available?)
- An (F1,F4)‐partition of graphs with low genus and girth at least 6
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
- Partitioning planar graphs without 4-cycles and 6-cycles into two disjoint subcubic forests
- \((\mathcal{F}_1, \mathcal{F})\)-partition of plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles
- An \((\mathcal{F}_2, \mathcal{F}_6)\)-partition of planar graphs without cycles of length 4 and 6
- An \((\mathcal{F}_3, \mathcal{F}_4)\)-partition of planar graphs without 4- and 6-cycles
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)
