Pages that link to "Item:Q534048"

The following pages link to Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048):

Displaying 12 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)
• The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
• Triangle decompositions of planar graphs (Q726643) (← links)
• Decomposing a graph into forests (Q765188) (← links)
• Decomposing plane cubic graphs (Q896062) (← 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)
• Generalized arboricity of graphs with large girth (Q1732768) (← links)
• The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
• Edge-partition and star chromatic index (Q2335139) (← links)