JOURNAL BROWSE
Search
Advanced SearchSearch Tips
SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS
Gao, Yunshu; Ma, Ding;
  PDF(new window)
 Abstract
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 and size at least contains three disjoint theta graphs. As a corollary, every graph of order and size at least contains three disjoint cycles of even length.
 Keywords
disjoint theta graphs;sufficient condition;minimum degree;
 Language
English
 Cited by
 References
1.
J. A. Bondy and U. S. R. Murty, Graph Theory, the second edition, Springer, 2008.

2.
S. Chiba, S. Fujita, Y. Gao, and G. Li, On a sharp degree sum condition for disjoint chorded cycles in graphs, Graphs Combin. 26 (2010), no. 2, 173-186. crossref(new window)

3.
K. Corradi and A. Hajnal, On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar. 14 (1963), 423-439. crossref(new window)

4.
G. A. Dirac, On the maximal number of independent triangles, Abh. Math. Sem. Univ. Hamburg 26 (1963), 78-82. crossref(new window)

5.
H. Enomoto, On the existence of disjoint cycles in a graph, Combinatorica 18 (1998), no. 4, 487-492. crossref(new window)

6.
D. Finkel, On the number Of independent chorded cycle in a graph, Discrete Math. 308 (2008), no. 22, 5265-5268. crossref(new window)

7.
Y. Gao and N. Ji, The extremal function for two disjoint cycles, Bull. Malays. Math. Sci. Soc. DOI:10.1007/s40840-014-0102-0,2014. crossref(new window)

8.
K. Kawarabayashi, $K^-_4$-factor in graphs, J. Graph Theory 39 (2002), no. 2, 111-128. crossref(new window)

9.
L. Posa, On the circuits of finite graphs, Magyar Tud. Akad. Mat. Kut. Int. Kozl. 8 (1963), 355-361.

10.
H. Wang, On the maximum number of independent cycles in a graph, Discrete Math. 205 (1999), no. 1-3, 183-190. crossref(new window)