Pages that link to "Item:Q2025062"

The following pages link to On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062):

Displaying 8 items.

• An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
• Packing 3-vertex paths in claw-free graphs and related topics (Q617645) (← links)
• An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
• Bounded clique cover of some sparse graphs (Q2359963) (← links)
• On packing 3-vertex paths in a graph (Q2725320) (← links)
• Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)
• The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
• The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)