CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On Eulerian orientations of even-degree hypercubes
Authors
L. Sunil Chandran
Joseph Cheriyan
Maxwell Levit
Publication date
1 September 2018
Publisher
'Elsevier BV'
Doi
Cite
View
on
arXiv
Abstract
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/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.Natural Sciences and Engineering Research Council of Canada ["RGPIN–2014–04351"
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
University of Waterloo's Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:uwspace.uwaterloo.ca:10012...
Last time updated on 05/11/2018