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

Finding all the hamiltonian paths of a graph and investigation of hamiltonian-connected graphs

โœ Scribed by V.P. Kozyrev

Publisher
Elsevier Science
Year
1976
Weight
700 KB
Volume
16
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
โœ George R. T. Hendry ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 491 KB ๐Ÿ‘ 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

All 4-connected Line Graphs of Claw Free
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected
โœ Matthias Kriesell ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 109 KB

Thomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see that 4-connected line graphs of claw free graphs are hamiltonian connected.

On the Approximation of Finding A(nother
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
โœ Cristina Bazgan; Miklos Santha; Zsolt Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 144 KB

It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle is NP-hard in general, and no polynomial-time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the co

3-Connected line graphs of triangular gr
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
โœ H. J. Broersma; H. J. Veldman ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 368 KB ๐Ÿ‘ 1 views

A graph is k-triangular if each edge is in at least k triangles. Triangular is a synonym for l-triangular. It is shown that the line graph of a triangular graph of order at least 4 is panconnected if and only if it is 3-connected. Furthermore, the line graph of a k-triangular graph is k-harniltonian