We prove that, with some exceptions, every digraph with n 3 9 vertices and at least ( n -1) ( n -2) + 2 arcs contains all orientations of a Hamiltonian cycle.
Orientations of Hamiltonian cycles in bipartite digraphs
✍ Scribed by A. P. Wojda; M. Woźniak
- Publisher
- Springer Netherlands
- Year
- 1994
- Tongue
- English
- Weight
- 309 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0031-5303
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract We show that a directed graph of order __n__ will contain __n__‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + __n__^‐1/6^)__n__ and __n__ is sufficiently large. © 1995 John Wiley & Sons, Inc.
## Abstract In this article, we shall prove that every bipartite quadrangulation __G__ on the torus admits a simple closed curve visiting each face and each vertex of __G__ exactly once but crossing no edge. As an application, we conclude that the radial graph of any bipartite quadrangulation on th
## Abstract We give necessary and sufficient conditions for the existence of an alternating Hamiltonian cycle in a complete bipartite graph whose edge set is colored with two colors.