Supereulerian graphs in the graph family C2(6,k)

  • Authors:

  • Hong-Jian Lai;Yanting Liang

  • Affiliations:

  • College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, People's Republic of China and Department of Mathematics, West Virginia University, Morgantown, WV 26506-6 ...;Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, United States

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2011

Quantified Score

Hi-index 0.04

Visualization

Abstract

For integers l and k with l0, and k=0, C"h(l,k) denotes the collection of h-edge-connected simple graphs G on n vertices such that for every edge-cut X with 2@?|X|@?3, each component of G-X has at least (n-k)/l vertices. We prove that for any integer k0, there exists an integer N=N(k) such that for any n=N, any graph G@?C"2(6,k) on n vertices is supereulerian if and only if G cannot be contracted to a member in a well-characterized family of graphs. This extends former results in [J. Adv. Math. 28 (1999) 65-69] by Catlin and Li, in [Discrete Appl. Math. 120 (2002) 35-43] by Broersma and Xiong, in [Discrete Appl. Math. 145 (2005) 422-428] by D. Li, Lai and Zhan, and in [Discrete Math. 309 (2009) 2937-2942] by X. Li, D. Li and Lai.