๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parameterized Algorithms in Smooth 4-Regular Hamiltonian Graphs

โœ Scribed by Egbert Mujuni

Book ID
107508842
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
149 KB
Volume
1
Category
Article
ISSN
1661-8270

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

3-colorability of 4-regular hamiltonian
3-colorability of 4-regular hamiltonian graphs
โœ Herbert Fleischner; Gert Sabidussi ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 187 KB ๐Ÿ‘ 1 views

## Abstract On the model of the cycleโ€plusโ€triangles theorem, we consider the problem of 3โ€colorability of those 4โ€regular hamiltonian graphs for which the components of the edgeโ€complement of a given hamiltonian cycle are nonโ€selfcrossing cycles of constant length โ‰ฅ 4. We show that this problem is

Uniqueness of maximal dominating cycles
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs
โœ Herbert Fleischner ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 461 KB ๐Ÿ‘ 2 views

## Abstract We construct 3โ€regular (cubic) graphs __G__ that have a dominating cycle __C__ such that no other cycle __C__~1~ of __G__ satisfies __V(C)__ โŠ† __V__(__C__~1~). By a similar construction we obtain loopless 4โ€regular graphs having precisely one hamiltonian cycle. The basis for these const

Edge-hamiltonian property in regular 2-
Edge-hamiltonian property in regular 2- connected graphs
โœ Hao Li ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 515 KB

Bill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is hamiltonian. It is shown in this paper that, under almost the same conditions as above, the graphs are edge-hamiltonian.