UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

On Eulerian orientations of even-degree hypercubes

Thumbnail Image

Files

1-s2.0-S0167637718300610-main.pdf (361.03 KB)

Date

2018-09-01

Authors

Levit, Maxwell
Chandran, L. Sunil
Cheriyan, Joseph

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

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.

Description

The final publication is available at Elsevier via https://dx.doi.org/10.1016/j.orl.2018.09.002 © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/

Keywords

Graph connectivity, Graph orientations, Hypercubes

LC Keywords

Citation

URI

https://dx.doi.org/10.1016/j.orl.2018.09.002
 http://hdl.handle.net/10012/14037

Collections

Waterloo Research
Combinatorics and Optimization