On Eulerian orientations of even-degree hypercubes
Combinatorics
2018-10-19 v1
Abstract
It is well known that \textit{every} Eulerian orientation of an Eulerian -edge connected (undirected) graph is strongly -edge connected. An important goal in the area is to obtain analogous results for other types of connectivity, such as node connectivity and element connectivity. We show that \textit{every} Eulerian orientation of the hypercube of degree is strongly -node connected.
Keywords
Cite
@article{arxiv.1809.08507,
title = {On Eulerian orientations of even-degree hypercubes},
author = {Maxwell Levit and L. Sunil Chandran and Joseph Cheriyan},
journal= {arXiv preprint arXiv:1809.08507},
year = {2018}
}