Premium
Hamiltonian results in K 1,3 ‐free graphs
Author(s) -
Matthews M. M.,
Sumner D. P.
Publication year - 1984
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190080116
Subject(s) - mathematics , combinatorics , pancyclic graph , vertex (graph theory) , hamiltonian (control theory) , graph , hamiltonian path , hamiltonian path problem , discrete mathematics , indifference graph , chordal graph , 1 planar graph , mathematical optimization
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom