Packing 3-Vertex Paths in 2-Connected Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Combinatorics, 05C10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/144911

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0712.4151
 http://arxiv.org/abs/0712.4151

Collections

arXiv