Computing sharp 2-factors in claw-free graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5162 LNCS, Issue , 2008, Pages 193-204

  Broersma, Hajo ^a   Paulusma, Daniël ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; FOUNDATIONS; GRAPH THEORY;

COMPUTING; CONSTRUCTIVE PROOFS; FREE GRAPHS; MINIMUM DEGREES; NUMBER OF COMPONENTS; POLYNOMIAL ALGORITHMS; UPPER BOUNDS;

COMPUTATIONAL GEOMETRY;

EID: 54249158770     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85238-4_15     Document Type: Conference Paper

References (20)

1. Broersma, H.J., Paulusma, D., Yoshimoto, K.: Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs (submitted), http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/claw.pdf
2. Broersma, H.J., Trommel, H.: Closure concepts for claw-free graphs. Discrete Math. 185, 231-238(1998)
3. 1,3-free graphs. J. Graph Theory 15, 259-265 (1991)
4. Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2000)
5. 1,n-free graphs. J. Graph Theory 15, 337-344 (1991)
6. Faudree, R.J., Favaron, O., Flandrin, E., Li, H., Liu, Z.: On 2-factors in claw-free graphs. Discrete Math. 206, 131-137 (1999)
7. Faudree, R., Flandrin, E., Ryjáček, Z.: Claw-free graphs - a survey. Disc. Math. 164, 87-147 (1997)
8. Fronček, D., Ryjáček, Z., Skupień, Z.: On traceability and 2-factors in claw-free graphs. Discussiones Mathematicae Graph Theory 24, 55-71 (2004)
9. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co, New York (1979)
10. Gould, R., Hynds, E.: A note on cycles in 2-factors of line graphs. Bull. of ICA. 26, 46-48 (1999)
11. Gould, R.J., Jacobson, M.S.: Two-factors with few cycles in claw-free graphs. Discrete Math. 231, 191-197(2001)
12. Harary, F: Graph Theory. Addison-Wesley, Reading MA (1969)
13. Jackson, B., Yoshimoto, K.: Even subgraphs of bridgeless graphs and 2-factors of line graphs. Discrete Math. 307, 2775-2785 (2007)
14. Lovasz, L., Plummer, M.D.: Matching Theory, North-Holland Mathematics Studies 121. North-Holland, Amsterdam
15. 1,3-free graphs. J. Graph Theory 8, 139-146 (1984)
16. Plummer, M.D.: Graph factors and factorization: 1985-2003: A survey. Discrete Math. 307, 791-821 (2007)
17. Roussopoulos, N.D.: A max{m, n} algorithm for determining the graph H from its line graph G. Information Processing Letters 2, 108-112 (1973)
18. Ryjacek, Z.: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B 70, 217-224 (1997)
19. Ryjacek, Z., Saito, A., Schelp, R.H.: Closure, 2-factor, and cycle coverings in claw-free graphs. J. Graph Theory 32, 109-117 (1999)
20. Yoshimoto, K.: On the number of components in a 2-factor of a claw-free graph. Discrete Math. 307, 2808-2819 (2007)