𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Embedding of a Class of Regular Graphs in a Faulty Hypercube

✍ Scribed by Yu-Chee Tseng; Ten-Hwang Lai

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
293 KB
Volume
37
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A class of Hamiltonian regular graphs
A class of Hamiltonian regular graphs
✍ Paul ErdΓΆs; Arthur M. Hobbs πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 317 KB

## Abstract In this paper, we show that __n__ β©Ύ 4 and if __G__ is a 2‐connected graph with 2__n__ or 2__n__βˆ’1 vertices which is regular of degree __n__βˆ’2, then __G__ is Hamiltonian if and only if __G__ is not the Petersen graph.

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

Orthogonal A-Trails of 4-Regular Graphs
Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus
✍ Lars DΓΈvling Andersen; AndrΓ© Bouchet; Bill Jackson πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 390 KB

Anton Kotzig has shown that every connected 4-regular plane graph has an A-trail, that is an Euler trail in which any two consecutive edges lie on a common face boundary. We shall characterise the 4-regular plane graphs which contain two orthogonal A-trails, that is to say two A-trails for which no

A Note on Almost Regular Graphs
A Note on Almost Regular Graphs
✍ M. Of Hofmeister Munich πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

It can easily be seen that a conjecture of RUNGE does not hold for a class of graphs whose members will be called "almost regular". This conjecture is replaced by a weaker one, and a classification of almost regular graphs is given.