Hamiltonian results in <i>K</i><sub>1,3</sub>‐free graphs 论文
1984Journal of Graph Theory引用 232
Advanced Graph Theory ResearchGraph theory and applicationsGraph Labeling and Dimension Problems
摘要
Abstract There have been a number of results dealing with Hamiltonian properties in powers of graphs. In this paper we show that the square and the total graph of a K 1,3 ‐free graph are vertex pancyclic. We then discuss some of the relationships between connectivity and Hamiltonian properties in K 1,3 ‐free graphs.