✦ LIBER ✦
How many disjoint 2-edge paths must a cubic graph have?
✍ Scribed by Alexander Kelmans; Dhruv Mubayi
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 234 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In this paper we show that every simple cubic graph on n vertices has a set of at least ⌈ n/4 ⌉ disjoint 2‐edge paths and that this bound is sharp. Our proof provides a polynomial time algorithm for finding such a set in a simple cubic graph. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 57–79, 2003