2007/12/26 by Alexander Kelmans, Kelmans, Alexander · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.CO #msc:05C10
paper · pdf · doi:10.48550/arxiv.0712.4151
13 pages, 14 figures
arxiv created 2007/12/26 · arxiv updated 2009/12/01
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.