Article ID Journal Published Year Pages File Type
4649508 Discrete Mathematics 2010 5 Pages PDF
Abstract

We show a construction that gives an infinite family of claw-free graphs of connectivity κ=2,3,4,5κ=2,3,4,5 with complete closure and without a cycle of a given fixed length. This construction disproves a conjecture by the first author, A. Saito and R.H. Schelp.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On cycle lengths in claw-free graphs with complete closure
Authors
, , ,