𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The orientation number of two complete graphs with linkages

✍ Scribed by K.M. Koh; K.L. Ng

Book ID
108113535
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
719 KB
Volume
295
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Number of Nonisomorphic Orientabl
On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs
✍ Vladimir P. Korzhik; Heinz-Jurgen Voss πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 260 KB

In this paper we consider those 2-cell orientable embeddings of a complete graph K n+1 which are generated by rotation schemes on an abelian group 8 of order n+1, where a rotation scheme an 8 is defined as a cyclic permutation ( ; 1 , ; 2 , ..., ; n ) of all nonzero elements of 8. It is shown that t

The chromatic number of oriented graphs
The chromatic number of oriented graphs
✍ Sopena, Eric πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 198 KB πŸ‘ 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with

The Colour Numbers of Complete Graphs
The Colour Numbers of Complete Graphs
✍ Behzad, M.; Chartrand, G.; Cooper, J. K. πŸ“‚ Article πŸ“… 1967 πŸ› Oxford University Press 🌐 English βš– 214 KB
On the number of triangular embeddings o
On the number of triangular embeddings of complete graphs and complete tripartite graphs
✍ M. J. Grannell; M. Knor πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 159 KB

## Abstract We prove that for every prime number __p__ and odd __m__>1, as __s__β†’βˆž, there are at least __w__ face 2‐colorable triangular embeddings of __K__~__w, w, w__~, where __w__ = __m__Β·__p__^__s__^. For both orientable and nonorientable embeddings, this result implies that for infinitely many