10 citations · 19 across the 3 of their papers we have counts for
3 papers
math.CO2005
Elementary elliptic -polycycles
Michel Deza, Mathieu Dutour, Mikhail Shtogrin
We consider the following generalization of the decomposition theorem for polycycles. A {\em -polycycle} is, roughly, a plane graph, whose faces, besides some disjoint {\em…
math.CO2004★ 9 cited
Graphs that are isometrically embeddable in hypercubes
Michel Deza, Mathieu Dutour-Sikiric, Sergey Shpectorov
A connected 3-valent plane graph, whose faces are - or 6-gons only, is called a {\em graph }. We classify all graphs , which are isometric subgraphs of a -hypercube…
math.CO2004★ 10 cited
Zigzag structure of complexes
Michel Deza, Mathieu Dutour
Inspired by Coxeter's notion of Petrie polygon for -polytopes (see \cite{Cox73}), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigz…