| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 11005590 | Operations Research Letters | 2018 | 4 Pages |
Abstract
It is well known that every Eulerian orientation of an Eulerian 2k-edge connected (undirected) graph is strongly k-edge connected. A long-standing goal in the area is to obtain analogous results for other types of connectivity, such as node connectivity. We show that every Eulerian orientation of the hypercube of degree 2k is strongly k-node connected.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Maxwell Levit, L. Sunil Chandran, Joseph Cheriyan,