Every 3-connected {K1, 3, Z7}-free graph of order at least 21 is Hamilton-connected.

Zdenek Ryjácek Petr Vrána

Published in: Discret. Math. (2021)

Keyphrases

connected components
neighborhood graph
database
neural network
real time
machine learning
artificial intelligence
case study
random walk
structured data
graph theory
graph structure