Abstract
Let G be a 2-connected claw-free graph such that δ(G) ≥ 5. Then for every function f: V(G) → {1, 2}, where ∑ x∈V(G) f(x) is even, G has an f-factor.
Cite
CITATION STYLE
APA
Fourtounelli, O., & Katerinis, P. (2012). On f-factors in claw-free graphs. Australasian Journal of Combinatorics, 52, 133–140.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free