most citedCartesian product of hypergraphs: properties and algorithms

9 citations · 9 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2013

A generalized closure concept based on neighborhood-equivalence and preserving graph Hamiltonicity

Thierry Vallee

A graph is Hamiltonian if it contains a cycle which goes through all vertices exactly once. Determining if a graph is Hamiltonian is known as a NP-complete problem and no satisfact…