DISJOINT SMALL CYCLES IN GRAPHS

  • Gao, Yunshu (School of Mathematics and System Science, Shandong University) ;
  • Li, Guojun (School of Mathematics and System Science, Shandong University) ;
  • Yan, Jin (School of Mathematics and System Science, Shandong University)
  • 발행 : 2009.05.31

초록

We call a cycle C be a small cycle if the length of C equals to 3 or 4. In this paper, we obtain two sufficient conditions to ensure the existence of vertex-disjoint small cycles in graph and propose several problems.

키워드

참고문헌

  1. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, MacMillan, London, 1976.
  2. S. Brandt, G. Chen, R. Faudree, R. J. Gould and L. Lesniak, Degree conditions for 2-factors, J. Graph Theory, Vol. 24(1997), 165-173. https://doi.org/10.1002/(SICI)1097-0118(199702)24:2<165::AID-JGT4>3.0.CO;2-O
  3. K. Corradi and A. Hajnal, On the maximal number of independent circuits in a graph, Acta Math Acad Sci Hungar, Vol. 14(1963), 423-439. https://doi.org/10.1007/BF01895727
  4. J. Dong, k disjoint cycles containing specified independent vertices, DiscreteMath. (2007), doi: 10.1016/j.disc.2007.09.028.
  5. P. Erdos, Some recent combinatorial problems, preprint, November 1990.
  6. Y. Gao, J. Yan and G. Li, Vertex Disjoint Triangles and Quadrilaterals in a Graph, submitted.
  7. H. Li and J. Li, Indepdendent triangle covering given vertices of a graph, Theorecticl Computer Science, Vol. 263(2001), 333-344. https://doi.org/10.1016/S0304-3975(00)00253-X
  8. R. Johansson, On the bipartite case of EI-Zahar's conjecture, Discrete Math. Vol. 219(2000), 123-134. https://doi.org/10.1016/S0012-365X(00)00086-8
  9. B. Randerath, I. Schiermeyer, H. Wang, On quadrilaterals in a graph, Discrete Math. Vol. 203(1999), 229-237.
  10. H. Wang, Vertex-disjoint quadrilaterals in graph, Discrete Math, Vol. 288(2004), 149-166. https://doi.org/10.1016/j.disc.2004.02.020
  11. J. Yan, Disjoint triangles and quadrilaterals in a graph, Discrete Math. (2007), doi:10.1016/j.disc.2007.07.098