Bull. Korean Math. Soc. 2015; 52(1): 287-299
Printed January 31, 2015
https://doi.org/10.4134/BKMS.2015.52.1.287
Copyright © The Korean Mathematical Society.
Yunshu Gao and Ding Ma
Ningxia University, Ningxia University
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.
Keywords: disjoint theta graphs, sufficient condition, minimum degree
MSC numbers: 05C35, 05C70
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd