Packing 3-Vertex Paths in 2-Connected Graphs

Simple item page
dc.creatorKelmans, Alexander
dc.date2007-12-26
dc.date.accessioned2026-07-07T08:51:22Z
dc.date.available2026-07-07T08:51:22Z
dc.descriptionWe 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.
dc.description13 pages, 14 figures
dc.identifierhttps://arxiv.org/abs/0712.4151
dc.identifierhttp://arxiv.org/abs/0712.4151
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144911
dc.subjectCombinatorics
dc.subject05C10
dc.titlePacking 3-Vertex Paths in 2-Connected Graphs
dc.typetext

Files

Collections

arXiv