Institute for Theoretical Information Technology

Complete closure and regular factors

Authors

T. Niessen,

Abstract

        The complete stability cs(P_k), where P_k denotes the property of having a k-factor, is cs(P_k)=n+k-2, if 1 <= k <= 3, and satisfies n+k-2 <= cs(P_k) <= n+k-1, if k >= 4. This improves results of Faudree, Favaron, Flandrin and Li. The exact value of the complete bistability of bipartite graphs is also determined.

BibT_EX Reference Entry 

@article{Ni97c,
	author = {Thomas Niessen},
	title = "Complete closure and regular factors",
	pages = "145-160",
	journal = "J. Comb. Math. Comb. Comput.",
	volume = "25",
	year = 1997,
	hsb = RWTH-CONV-223152,
	}

Downloads

 _{Download bibtex-file}

Sorry, this paper is currently not available for download.