Article thumbnail

Packing Three-Vertex Paths in a Subcubic Graph

By Adrian Kosowski and et al. Michał Małafiejski

Abstract

In our paper we consider the P3-packing problem in subcubic graphs of different connectivity, improving earlier results of Kelmans and Mubayi (5). We show that there exists a P3-packing of at least ⌈3n/4 ⌉ vertices in any connected subcubic graph of order n> 5 and minimum vertex degree δ ≥ 2, and that this bound is tight. The proof is constructive and implied by a linear-time algorithm. We use this result to show that any 2-connected cubic graph of order n> 8 has a P3-packing of at least ⌈7n/9 ⌉ vertices

Topics: three-vertex paths, subcubic graphs, path packing
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.381.1359
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.maths.tcd.ie/EMIS/j... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.