Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs

A chorded cycle is a cycle with at least one chord. We prove that if G is a simple graph with order n ≥ 4 k and for each nonadjacent pair of vertices x and y , then G contains k vertex-disjoint chorded cycles. The degree condition is sharp in general.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Graphs and combinatorics 2013-09, Vol.29 (5), p.1337-1345
Hauptverfasser:	Gao, Yunshu, Li, Guojun, Yan, Jin
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Engineering Design Graph theory Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A chorded cycle is a cycle with at least one chord. We prove that if G is a simple graph with order n ≥ 4 k and for each nonadjacent pair of vertices x and y , then G contains k vertex-disjoint chorded cycles. The degree condition is sharp in general.
ISSN:	0911-0119 1435-5914
DOI:	10.1007/s00373-012-1200-0