Pages that link to "Item:Q5324105"

The following pages link to Decompositions of quadrangle-free planar graphs (Q5324105):

Displaying 15 items.

• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
• Decomposing a planar graph with girth 9 into a forest and a matching (Q925026) (← 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)
• Gallai's path decomposition conjecture for triangle-free planar graphs (Q1732776) (← links)
• The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
• Decomposition of some planar graphs into trees (Q1916140) (← links)
• The game coloring number of planar graphs with a given girth (Q2017053) (← links)
• The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
• Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs (Q2357161) (← links)
• Decomposition of planar graphs with forbidden configurations (Q2691577) (← links)
• Decomposition of planar graphs without 5-cycles or \(K_4\) (Q2824066) (← links)
• Decomposition of sparse graphs into forests and a graph with bounded degree (Q2862551) (← links)
• Forests decomposition of graphs without 4-cycles (Q2926959) (← links)
• New upper bounds on the decomposability of planar graphs (Q3376690) (← links)