Packing 3-Vertex Paths in 2-Connected Graphs
arXiv:0712.4151
Abstract
We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex path in G is less than k.
13 pages, 14 figures