Premium
Hamiltonian circuits in N 2 ‐locally connected K 1,3 ‐free graphs
Author(s) -
Ryjáček ZdeněK
Publication year - 1990
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.3190140305
Subject(s) - mathematics , conjecture , combinatorics , hamiltonian path , vertex (graph theory) , hamiltonian (control theory) , graph , discrete mathematics , mathematical optimization
There are many results concerned with the hamiltonicity of K 1,3 ‐free graphs. In the paper we show that one of the sufficient conditions for the K 1,3 ‐free graph to be Hamiltonian can be improved using the concept of second‐type vertex neighborhood. The paper is concluded with a conjecture.
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