@article {IOPORT.05844299,
    author       = {Kosowski, A. and \D {Z}yli\'nski, P.},
    title        = {Packing three-vertex paths in 2-connected cubic graphs.},
    year         = {2008},
    journal      = {Ars Combinatoria},
    volume       = {89},
    issn         = {0381-7032},
    pages        = {95-113},
    publisher    = {Charles Babbage Research Centre, Winnipeg, MB},
    abstract     = {Summary: We show that every 2-connected cubic graph of order $n>8$ admits a $P_{3}$-packing of at least $\lceil 9n/11\rceil $ vertices. The proof is constructive, implying an $O(M(n))$ time algorithm for constructing such a packing, where $M(n)$ is the time complexity of the perfect matching problem for 2-connected cubic graphs.},
    identifier   = {05844299},
}