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 10 items.

• Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
• Sparse partition universal graphs for graphs of bounded degree (Q633606) (← links)
• Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
• On the \(k\)-component independence number of a tree (Q2045314) (← links)
• Fair splittings by independent sets in sparse graphs (Q2182042) (← links)
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361) (← links)
• Partitioning sparse plane graphs into two induced subgraphs of small degree (Q2454534) (← 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)