Packingk-edge trees in graphs of restricted vertex degrees

DOI10.1002/JGT.20238zbMath1122.05047arXivmath/0610384OpenAlexW2953266710MaRDI QIDQ3594953

Alexander K. Kelmans

Publication date: 9 August 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0610384

zbMATH Keywords

subgraph packingpolynomial time approximation algorithms\(k\)-edge trees2-edge and \(k\)-edge paths

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Packing 3-vertex paths in claw-free graphs and related topics ⋮ On maximum \(P_3\)-packing in claw-free subcubic graphs ⋮ Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph

Cites Work

• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Unnamed Item
• Unnamed Item

This page was built for publication: Packingk-edge trees in graphs of restricted vertex degrees