The following pages link to Decomposing a graph into forests (Q765188):
Displaying 30 items.
- Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Decomposing a graph into pseudoforests with one having bounded degree (Q490985) (← links)
- The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- Decomposing plane cubic graphs (Q896062) (← links)
- Decomposing a planar graph with girth 9 into a forest and a matching (Q925026) (← links)
- Planar graphs decomposable into a forest and a matching (Q998522) (← links)
- Tree-thickness and caterpillar-thickness under girth constraints (Q1010820) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- Decomposing 4-connected planar triangulations into two trees and one path (Q1633745) (← links)
- On the game coloring index of \(F^+\)-decomposable graphs (Q1693133) (← links)
- Thin trees in 8-edge-connected planar graphs (Q1711432) (← links)
- Decomposing graphs into a spanning tree, an even graph, and a star forest (Q1732026) (← links)
- Generalized arboricity of graphs with large girth (Q1732768) (← links)
- Decomposing a graph into forests and a matching (Q1748265) (← links)
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs (Q1750785) (← links)
- The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- The pseudoforest analogue for the strong nine dragon tree conjecture is true (Q2200931) (← links)
- Decomposing a planar graph into a forest and a subgraph of restricted maximum degree (Q2481185) (← links)
- Decomposition of sparse graphs into forests and a graph with bounded degree (Q2862551) (← links)
- Forests decomposition of graphs without 4-cycles (Q2926959) (← links)
- (Q4218149) (← links)
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering (Q4568066) (← links)
- (Q5149013) (← links)
- Digraph analogues for the Nine Dragon Tree Conjecture (Q6046686) (← links)
- Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)
- On the minimum number of arcs in \(k\)-dicritical oriented graphs (Q6561323) (← links)
- An extension of Nash-Williams and Tutte's theorem (Q6657600) (← links)
