On a Closure Concept in Claw-Free Graphs
Author:
- Zdeněk RyjáčekZRZdeněk Ryjáček
- 1 July 1997
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 70 (2) , 217-224
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On hamiltonian line graphs and connectivityDiscrete Mathematics, 1991
- Hamiltonian circuits inN2-locally connectedK1,3-free graphsJournal of Graph Theory, 1990
- Reflections on graph theoryJournal of Graph Theory, 1986
- Toughness and the existence of k‐factorsJournal of Graph Theory, 1985
- Hamiltonian results in K1,3‐free graphsJournal of Graph Theory, 1984
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonianJournal of Graph Theory, 1979
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973