Tighter Bounds on the Size of a Maximum P^sub 3^-Matching in a Cubic Graph
We establish that for any connected cubic graph G of order n > 16 the maximum P3-matching in G consists of at least 117/152 n vertices. [PUBLICATION ABSTRACT]
Gespeichert in:
| Veröffentlicht in: | Graphs and combinatorics 2008-10, Vol.24 (5), p.461 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We establish that for any connected cubic graph G of order n > 16 the maximum P3-matching in G consists of at least 117/152 n vertices. [PUBLICATION ABSTRACT] |
|---|---|
| ISSN: | 0911-0119 1435-5914 |
| DOI: | 10.1007/s00373-008-0807-7 |