Neighborhood unions, degree sums, toughness and 2-factors


D. Bauer, T. Niessen, E. Schmeichel,


        It is well-known that every 2-tough graph has a 2-factor. We consider t-tough graphs with 1 <= t <= 2. It is shown that these graphs have 2-factors, if their neighborhood union or degree sum is large enough.

BibTEX Reference Entry 

	author = {Douglas Bauer and Thomas Niessen and Edward Schmeichel},
	title = "Neighborhood unions, degree sums, toughness and 2-factors",
	pages = "47-57",
	journal = "Congress. Numer.",
	volume = "100",
	year = 1994,
	hsb = RWTH-CONV-223139,


 Download bibtex-file

Sorry, this paper is currently not available for download.