Packing three-vertex paths in 2-connected cubic graphs.
From MaRDI portal
Recommendations
- Packing three-vertex paths in a subcubic graph
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
- On maximum \(P_3\)-packing in claw-free subcubic graphs
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
- scientific article; zbMATH DE number 637534
Cited in
(15)- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- Pathwidth of cubic graphs and exact algorithms
- On maximum \(P_3\)-packing in claw-free subcubic graphs
- On packing 3-vertex paths in a graph
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
- Packing three-vertex paths in a subcubic graph
- scientific article; zbMATH DE number 637534 (Why is no real title available?)
- How many disjoint 2-edge paths must a cubic graph have?
- scientific article; zbMATH DE number 2197914 (Why is no real title available?)
- Packing 2- and 3-stars into cubic graphs
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices
- The packing number of cubic graphs
- The maximum 3-star packing problem in claw-free cubic graphs
- Packing 2- and 3-stars into ( 2 , 3 )-regular graphs
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
This page was built for publication: Packing three-vertex paths in 2-connected cubic graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070345)
