𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of a class of regular graphs

✍ Scribed by A Ramachandra Rao

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
618 KB
Volume
10
Category
Article
ISSN
0095-8956

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 a class of Hamiltonian laceable 3-reg
On a class of Hamiltonian laceable 3-regular graphs
✍ Brian Alspach; C.C. Chen; Kevin McAvaney πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 741 KB

Using the concept of brick-products, Alspach and Zhang showed in that all cubic Cayley graphs over dihedral groups are Hamiltonian. It is also conjectured that all brick-products C(2n, m, r) are Hamiltonian laceable, in the sense that any two vertices at odd distance apart can be joined by a Hamilt

A class of regular rings
A class of regular rings
✍ Ferenc SzΓ‘sz πŸ“‚ Article πŸ“… 1971 πŸ› Springer Vienna 🌐 English βš– 232 KB
Characterizing intersection classes of g
Characterizing intersection classes of graphs
✍ Edward R. Scheinerman πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 571 KB

A graph is an intersection graph if it is possible to assign sets to its vertices so that adjacency corresponds exactly to nonempty intersection. If the sets assigned to vertices must belong to a pre-specified family, the resulting class of all possible intersection graphs is called an intersection