M. Deza

activity

19992005

most citedZigzag structure of complexes

10 citations · 21 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2005

Elementary elliptic $(R, q)$ -polycycles

Michel Deza, Mathieu Dutour, Mikhail Shtogrin

We consider the following generalization of the decomposition theorem for polycycles. A {\em $(R, q)$ -polycycle} is, roughly, a plane graph, whose faces, besides some disjoint {\em…

math.CO2004★ 9 cited

Graphs $4_{n}$ that are isometrically embeddable in hypercubes

Michel Deza, Mathieu Dutour-Sikiric, Sergey Shpectorov

A connected 3-valent plane graph, whose faces are $q$ - or 6-gons only, is called a {\em graph $q_{n}$ }. We classify all graphs $4_{n}$ , which are isometric subgraphs of a $m$ -hypercube…

math.CO2004★ 10 cited

Zigzag structure of complexes

Michel Deza, Mathieu Dutour

Inspired by Coxeter's notion of Petrie polygon for $d$ -polytopes (see \cite{Cox73}), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigz…

math.CO2000

Small cones of m-hemimetrics

M. Deza, I. Rosenberg

We introduce polyhedral cones associated with $m$ -hemimetrics on $n$ points, and, in particular, with $m$ -hemimetrics coming from partitions of an $n$ -set into $m + 1$ blocks. We com…

math.CO1999

On equicut graphs

Michel Deza, Dmitrii V. Pasechnik

The size sz(G) of an l_1-graph G=(V,E) is the minimum of n_f/t_f over all its possible l_1-embeddings f into n_f-dimensional hypercube with scale t_f. In terms of v=|V|, the sum of…