Pages that link to "Item:Q4210673"

The following pages link to Partition problems and kernels of graphs (Q4210673):

Displaying 12 items.

• The path partition conjecture is true for claw-free graphs (Q878616) (← links)
• A note on the path Kernel conjecture (Q1025521) (← links)
• Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
• Path partitions and \(P_{n}\)-free sets (Q1763347) (← links)
• Graphs with not all possible path-kernels (Q1877673) (← links)
• Extended path partition conjecture for semicomplete and acyclic compositions (Q2166278) (← links)
• Path partitioning planar graphs with restrictions on short cycles (Q2234425) (← links)
• Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
• Longest path partitions in generalizations of tournaments (Q2501556) (← links)
• Partition of a planar graph with girth 6 into two forests with chain length at most 4 (Q5264731) (← links)
• (Q5708569) (← links)
• On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)