Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649968 | Discrete Mathematics | 2008 | 10 Pages |
Abstract
We introduce a closure concept for a superclass of the class of claw-free graphs defined by a degree condition on end vertices of induced claws. We show that the closure of a graph is the line graph of a triangle-free graph, and that the closure operation preserves the length of a longest path and cycle. These results extend the closure concept for claw-free graphs introduced by Ryjáček.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roman Čada,