Pseudo-Hamiltonian-connected graphs


Given a graph G and a positive integer k, denote by G[k] the graph obtained from G by replacing each vertex of G with an independent set of size k. A graph G is called pseudo-k Hamiltonian-connected if G[k] is Hamiltonian-connected, i.e., every two distinct vertices of G[k] are connected by a Hamiltonian path. A graph G is called pseudo Hamiltonian… (More)
DOI: 10.1016/S0166-218X(99)00181-X


1 Figure or Table

Slides referencing similar topics