Decomposition of sparse graphs into forests and a graph with bounded degree
From MaRDI portal
Recommendations
Cites work
- Covering planar graphs with forests
- Covering planar graphs with forests, one having bounded maximum degree
- Decomposing a graph into forests
- Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
- Decomposing a planar graph with girth 9 into a forest and a matching
- Decomposing a planar graph with girth at least 8 into a forest and a matching
- Decomposition of Finite Graphs Into Forests
- Decomposition of sparse graphs, with application to game coloring number
- Decompositions of quadrangle-free planar graphs
- Edge-partitions of planar graphs and their game coloring numbers
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- Partitioning a planar graph of girth 10 into a forest and a matching
- Planar graphs decomposable into a forest and a matching
Cited in
(28)- Decompositions of graphs into forests with bounded maximum degree
- Decomposing 4-connected planar triangulations into two trees and one path
- Spanning tree with lower bound on the degrees
- Decomposing a graph into forests and a matching
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
- Colouring planar graphs with bounded monochromatic components
- The pseudoforest analogue for the strong nine dragon tree conjecture is true
- \(\{0, 2 \}\)-degree free spanning forests in graphs
- On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
- Degree bounded forest covering
- scientific article; zbMATH DE number 5919777 (Why is no real title available?)
- Covering a graph by forests and a matching
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
- scientific article; zbMATH DE number 4008408 (Why is no real title available?)
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
- Decomposing a graph into pseudoforests with one having bounded degree
- Decomposing a planar graph with girth at least 8 into a forest and a matching
- Digraph analogues for the Nine Dragon Tree Conjecture
- Degree conditions on copies of forests in graphs
- The strong nine dragon tree conjecture is true for d k + 1
- An extension of Nash-Williams and Tutte's theorem
- Beyond the pseudoforest strong nine dragon tree theorem
- The overfull nine dragon tree conjecture is true
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Triangle decompositions of planar graphs
- Decomposing a graph into forests
- Decomposing plane cubic graphs
This page was built for publication: Decomposition of sparse graphs into forests and a graph with bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2862551)
