On packing 3-vertex paths in a graph

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200104)36:4<175::AID-JGT1005>3.0.CO;2-T" /><175::AID-JGT1005>3.0.CO;2-T 10.1002/1097-0118(200104)36:4<175::AID-JGT1005>3.0.CO;2-TzbMath1060.05081OpenAlexW4255684225MaRDI QIDQ2725320

Atsushi Kaneko, Tsuyoshi Nishimura, Alexander K. Kelmans

Publication date: 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200104)36:4<175::aid-jgt1005>3.0.co;2-t

zbMATH Keywords

packing problemnet-free graphconnected claw-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ \(P_3\)-factors in the square of a tree ⋮ Packing 3-vertex paths in claw-free graphs and related topics ⋮ Some results about ID-path-factor critical graphs ⋮ \(P_k\)-factors in squares and line graphs of trees ⋮ The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices ⋮ On maximum \(P_3\)-packing in claw-free subcubic graphs ⋮ The generalized matcher game ⋮ Triangle-factors in powers of graphs ⋮ The existence of path-factor covered graphs ⋮ A \(5k\)-vertex kernel for \(P_2\)-packing

Cites Work

• Unnamed Item
• On component factors
• Optimal packing of induced stars in a graph
• On the Complexity of General Graph Factor Problems
• A homology theory for spanning tress of a graph
• Component factors and induced subgraphs

This page was built for publication: On packing 3-vertex paths in a graph