On cubic 2-independent Hamiltonian connected graphs

Tung-Yang Ho (), Chun-Nan Hung and Lih-Hsing Hsu
Additional contact information
Tung-Yang Ho: Ta Hwa Institute of Technology
Chun-Nan Hung: Da-Yeh University
Lih-Hsing Hsu: Providence University

Journal of Combinatorial Optimization, 2007, vol. 14, issue 2, No 17, 275-294

Abstract: Abstract A graph G=(V,E) is Hamiltonian connected if there exists a Hamiltonian path between any two vertices in G. Let P 1=(u 1,u 2,…,u |V|) and P 2=(v 1,v 2,…,v |V|) be any two Hamiltonian paths of G. We say that P 1 and P 2 are independent if u 1=v 1,u |V|=v |V|, and u i ≠v i for 1

Keywords: Hamiltonian; Hamiltonian connected; Connectivity (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9054-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:14:y:2007:i:2:d:10.1007_s10878-007-9054-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9054-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().