# Packing Three-Vertex Paths in a Subcubic Graph

Abstract : In our paper we consider the $P_3$-packing problem in subcubic graphs of different connectivity, improving earlier results of Kelmans and Mubayi. We show that there exists a $P_3$-packing of at least $\lceil 3n/4\rceil$ vertices in any connected subcubic graph of order $n>5$ and minimum vertex degree $\delta \geq 2$, and that this bound is tight. The proof is constructive and implied by a linear-time algorithm. We use this result to show that any $2$-connected cubic graph of order $n>8$ has a $P_3$-packing of at least $\lceil 7n/9 \rceil$ vertices.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [7 references]

https://hal.inria.fr/hal-01184370
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Friday, August 14, 2015 - 11:37:57 AM
Last modification on : Tuesday, October 19, 2021 - 11:27:27 PM
Long-term archiving on: : Sunday, November 15, 2015 - 11:02:33 AM

### File

dmAE0142.pdf
Publisher files allowed on an open archive

### Citation

Adrian Kosowski, Michal Malafiejski, Pawel Zyliński. Packing Three-Vertex Paths in a Subcubic Graph. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.213-218, ⟨10.46298/dmtcs.3413⟩. ⟨hal-01184370⟩

Record views