Construction of hamiltonian graphs and bigraphs with prescribed degrees |
| |
| Authors: | V Chungphaisan |
| |
| Institution: | Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada |
| |
| Abstract: | In this paper, we establish a laying-off algorithm for constructing a (simple) graph with prescribed degrees and with a Hamiltonian path starting at a specified vertex. This algorithm can be applied to construct a Hamiltonian graph with prescribed degrees. It is also shown that Hamiltonian bigraphs with prescribed degrees can be similarly constructed. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
