Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto. Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. Graphs and Combinatorics, 25(4):427-460, 2009. [doi]

The following publications are possibly variants of this publication:

On the number of components in 2-factors of claw-free graphsKiyoshi Yoshimoto. DM, 307(22):2808-2819, 2007. [doi]

2-factors with bounded number of components in claw-free graphsKenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto. DM, 338(5):793-808, 2015. [doi]

On components of 2-factors in claw-free graphsHajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto. endm, 29:289-293, 2007. [doi]

Computing sharp 2-factors in claw-free graphsHajo Broersma, Daniël Paulusma. jda, 8(3):321-329, 2010. [doi]

Computing Sharp 2-Factors in Claw-Free GraphsHajo Broersma, Daniël Paulusma. mfcs 2008: 193-204 [doi]

runs on WebDSL