A Neighborhood Condition for Graphs to Have [a, b]-Factors III

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let a, b, k, and m be positive integers such that 1 ≤a (a + b)(k(a + b - 1) - 1)/b and |N G (x 1) ∪ N G (x 2)... ∪ N G (xk )| ≥ a|G|/(a + b) for every independent set { x 1, x 2, ..., x k} ⊆ V(G). Then for any subgraph H of G with m edges and δ(G - E(H))≥ a, G has an [a, b]-factor F such that E(H)∩ E(F) = θ. This result is best possible in some sense and it is an extension of the result of Matsuda (Discrete Mathematics 224 (2000) 289-292). © 2007 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kano, M., & Matsuda, H. (2007). A Neighborhood Condition for Graphs to Have [a, b]-Factors III. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4381 LNCS, pp. 70–78). https://doi.org/10.1007/978-3-540-70666-3_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free