A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs.

Adam Kabela Zdenek Ryjácek Mária Skyvová Petr Vrána

Published in: Discret. Math. (2024)

Keyphrases

directed graph
graph matching
graph structure
graph theoretic
connected components
graph model
constraint satisfaction problems
spanning tree
graph representation
random graphs
adjacency matrix
graph theoretical