9 citations · 9 across the 2 of their papers we have counts for
2 papers
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…
cs.DM2009★ 9 cited
Cartesian product of hypergraphs: properties and algorithms
Alain Bretto, Yannick Silvestre, Thierry Vallée
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of t…