Every 3-connected {K(1,3), Z(7)}-free graph of order at least 21 is Hamilton-connected
Date issued
2021
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Abstract
Description
Subject(s)
Citation
RYJÁČEK, Z., VRÁNA, P. Every 3-connected {K(1,3), Z(7)}-free graph of order at least 21 is Hamilton-connected. Discrete mathematics, 2021, roč. 344, č. 6. ISSN 0012-365X.