Partitioning planar graph of girth 5 into two forests with maximum degree 4.
From MaRDI portal
(Redirected from Publication:6584423)
Cites work
- (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
- Decomposing a triangle-free planar graph into a forest and a subcubic forest
- Defective 2-colorings of sparse graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- 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
- Near-colorings: non-colorable graphs and NP-completeness
- Near-proper vertex 2-colorings of sparse graphs
- 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, 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
This page was built for publication: Partitioning planar graph of girth 5 into two forests with maximum degree 4.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584423)
