Vertex-disjoint chorded cycles in a graph

Vertex-disjoint chorded cycles in a graph

In this paper we prove: Let k ≥ 1 be an integer and G be graph with at least 4 k vertices and minimum degree at least ⌊ 7 k / 2 ⌋ . Then G contains k vertex-disjoint cycles such that each of them has at least two chords in G .

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters 2010-11, Vol.38 (6), p.564-566
Hauptverfasser: Qiao, Shengning, Zhang, Shenggui
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Chord
Exact sciences and technology
Graphs
Integers
Minimum degree
Operational research. Management science
Operations research
Vertex disjoint
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we prove: Let k ≥ 1 be an integer and G be graph with at least 4 k vertices and minimum degree at least ⌊ 7 k / 2 ⌋ . Then G contains k vertex-disjoint cycles such that each of them has at least two chords in G .
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2010.09.007