Premium
A necessary and sufficient condition for connected, locally k‐connected k 1,3 ‐free graphs to be k‐hamiltonian
Author(s) -
HuaiLu Zhou
Publication year - 1989
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.3190130602
Subject(s) - mathematics , combinatorics , conjecture , hamiltonian (control theory) , graph , strongly connected component , connectivity , discrete mathematics , mathematical optimization
We prove the following conjecture of Broersma and Veldman: A connected, locally k ‐connected K 1,3 ‐free graph is k ‐hamiltonian if and only if it is ( k + 2)‐connected ( K ⩾ 1).
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