Pages that link to "Item:Q925026"

The following pages link to Decomposing a planar graph with girth 9 into a forest and a matching (Q925026):

Displaying 16 items.

• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
• Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
• The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
• Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
• On the small cycle transversal of planar graphs (Q551170) (← links)
• Decomposing a graph into forests (Q765188) (← links)
• Decomposing plane cubic graphs (Q896062) (← links)
• Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
• Planar graphs decomposable into a forest and a matching (Q998522) (← links)
• Covering planar graphs with forests, one having bounded maximum degree (Q1003834) (← links)
• Thin trees in 8-edge-connected planar graphs (Q1711432) (← links)
• Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree (Q2862551) (← links)
• Degree Bounded Forest Covering (Q3009772) (← links)
• Covering planar graphs with forests, one having a bounded maximum degree (Q5301001) (← links)