Abstract
The RyjǍcek closure is a powerful tool in the study of Hamiltonian properties of claw-free graphs. Because of its usefulness, we may hope to use it in the classes of graphs defined by another forbidden subgraph. In this note, we give a negative answer to this hope, and show that the claw is the only forbidden subgraph that produces non-trivial results on Hamiltonicity by the use of the RyjǍcek closure.
Original language | English |
---|---|
Pages (from-to) | 621-628 |
Number of pages | 8 |
Journal | Discussiones Mathematicae - Graph Theory |
Volume | 36 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2016 |
Keywords
- Claw-free graph
- Closure
- Hamiltonian graph
- Perfect matching
- Traceable graph