| author: | Adrian Kosowski, Michał Małafiejski and Paweł Żyliński |
|---|---|
| title: | Packing Three-Vertex Paths in a Subcubic Graph |
| keywords: | three-vertex paths, subcubic graphs, path packing |
| abstract: |
In our paper we consider the
P
-packing problem in subcubic graphs of different
connectivity, improving earlier results of Kelmans and
Mubayi [KM04]. We show that there exists a
3
P
-packing of at least
3
⌈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
P
-packing of at least
3
⌈7n/9 ⌉
vertices.
|
| If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
| reference: | Adrian Kosowski and Michał Małafiejski and Paweł Żyliński (2005), Packing Three-Vertex Paths in a Subcubic Graph, in 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Stefan Felsner (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AE, pp. 213-218 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dmAE0142.ps.gz (126 K) |
| ps-source: | dmAE0142.ps (524 K) |
| pdf-source: | dmAE0142.pdf (210 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.