Pages that link to "Item:Q2219964"

The following pages link to Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964):

Displaying 11 items.

• Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
• Independent domination of graphs with bounded maximum degree (Q2101177) (← links)
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
• (Q4797463) (← links)
• (Q4996553) (← links)
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable (Q6585244) (← links)
• Partitioning planar graphs into bounded degree forests (Q6585546) (← links)