Packing 3-Vertex Paths in 2-Connected Graphs
Combinatorics
2007-12-28 v1
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.
Cite
@article{arxiv.0712.4151,
title = {Packing 3-Vertex Paths in 2-Connected Graphs},
author = {Alexander Kelmans},
journal= {arXiv preprint arXiv:0712.4151},
year = {2007}
}
Comments
13 pages, 14 figures