Hamiltonian numbers of Möbius double loop networks-Reference-Cited by-同舟云学术

Hamiltonian numbers of Möbius double loop networks

Published:2010-10-14 Issue:4 Volume:23 Page:462-470
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Chang Gerard J.,Chang Ting-Pang,Tong Li-Da

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-010-9360-4.pdf

Reference15 articles.

1. Asano T, Nishizeki T, Watanabe T (1980) An upper bound on the length of a Hamiltonian walk of a maxima planar graph. J Graph Theory 4:315–336

2. Asano T, Nishizeki T, Watanabe T (1983) An approximation algorithm for the Hamiltonian walk problems on maximal planar graphs. Discrete Appl Math 5:211–222

3. Bermond JC (1976) On Hamiltonian walks. Congr Numer 15:41–51

4. Bondy JA, Murty USR (1976) Graph theory with applications. North-Holland, Amsterdam

5. Chartrand G, Saenpholphat V, Thomas T, Zhang P (2003) On the Hamiltonian number of a graph. Congr Numer 165:56–64

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hamiltonian Spectra of Graphs;Graphs and Combinatorics;2019-04-09

2. On the Hamiltonian number of a plane graph;Discussiones Mathematicae Graph Theory;2019

3. Hamiltonian numbers in oriented graphs;Journal of Combinatorial Optimization;2017-05-24

4. The hamiltonian numbers in digraphs;Journal of Combinatorial Optimization;2012-06-22