𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Number of Non-Hamiltonian Graphs

✍ Scribed by P. V. Roldugin

Book ID
111598198
Publisher
SP MAIK Nauka/Interperiodica
Year
2004
Tongue
English
Weight
135 KB
Volume
75
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the extremal number of edges in hamil
On the extremal number of edges in hamiltonian connected graphs
✍ Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J.M. Tan; D. Frank Hsu; Lih-Hsing Hsu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 421 KB

a b s t r a c t Assume that n and Ξ΄ are positive integers with 3 ≀ Ξ΄ < n. Let hc(n, Ξ΄) be the minimum number of edges required to guarantee an n-vertex graph G with minimum degree Ξ΄(G) β‰₯ Ξ΄ to be hamiltonian connected.

On the domination number of Hamiltonian
On the domination number of Hamiltonian graphs with minimum degree six
✍ Hua-Ming Xing; Johannes H. Hattingh; Andrew R. Plummer πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 177 KB

The domination number of G, denoted by Ξ³ (G), is the minimum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with minimum degree at least six, then Ξ³ (G) ≀ 6n 17 .

Independent Production of Non Hamiltonia
Independent Production of Non Hamiltonian Graphs
✍ Samuel Jurkiewicz; Kelly Elaine Fonseca Freitas; Daniela Fuchs SalomΓ£o πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 215 KB
On the number of hamiltonian cycles in a
On the number of hamiltonian cycles in a maximal planar graph
✍ S. L. Hakimi; E. F. Schmeichel; C. Thomassen πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 243 KB πŸ‘ 3 views

## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__‐vertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ β‰₯ 12. We also pro