Pages that link to "Item:Q2185923"

The following pages link to Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923):

Displaying 4 items.

• On the \(k\)-component independence number of a tree (Q2045314) (← links)
• Vertex Partitions into an Independent Set and a Forest with Each Component Small (Q5009333) (← links)
• (Q5878782) (← links)
• Path partition of planar graphs with girth at least six (Q6059078) (← links)