Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
From MaRDI portal
Publication:1014835
DOI10.1007/s00373-008-0807-7zbMath1204.05077MaRDI QIDQ1014835
Michał Małafiejski, Adrian Kosowski, Paweł Żyliński
Publication date: 29 April 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0807-7
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Cites Work
- Unnamed Item
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
- On the Complexity of General Graph Factor Problems
- Packingk-edge trees in graphs of restricted vertex degrees
- Path factors in cubic graphs
- Factors and factorizations of graphs—a survey
- How many disjoint 2-edge paths must a cubic graph have?