SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS

SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS

A theta graph is the union of three internally disjoint paths that have the same two distinct end vertices. We show that every graph of order $n \geq 12$ and size at least $\lfloor\frac{11n-18}{2}\rfloor$ contains three disjoint theta graphs. As a corollary, every graph of order $n\geq 12$ and size...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Taehan Suhakhoe hoebo 2015, 52(1), , pp.287-299
Hauptverfasser: Gao, Yunshu, Ma, Ding
Format: Artikel
Sprache:eng
Schlagworte:
수학
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A theta graph is the union of three internally disjoint paths that have the same two distinct end vertices. We show that every graph of order $n \geq 12$ and size at least $\lfloor\frac{11n-18}{2}\rfloor$ contains three disjoint theta graphs. As a corollary, every graph of order $n\geq 12$ and size at least $\lfloor\frac{11n-18}{2}\rfloor$ contains three disjoint cycles of even length. KCI Citation Count: 1
ISSN:1015-8634
2234-3016
DOI:10.4134/BKMS.2015.52.1.287