|
|||||
|
|
Hamiltonicity of Amalgams |
|
| Authors: | Arthur M Farley Andrzej Proskurowski Mirosława Skowrońska Maciej M Sysło |
| Institution: | (1) Department of Computer and Information Science, University of Oregon, Eugene, OR 97403, USA, US;(2) Department of Computer and Information Science, University of Oregon, Eugene, OR 97403, USA. e-mail: andrzej@cs.uoregon.edu, US;(3) Faculty of Mathematics and Informatics, Nicholas Copernicus University, ul. Chopina 12/18, 87100 Toruń, Poland, PL;(4) Institute of Computer Science, University of Wrocław, ul. Przesmyckiego 20, 51151 Wrocław, Poland, PL |
| Abstract: | An amalgam is obtained from two Halin graphs having skirting cycles of the same length. We are interested in hamiltonicity of amalgams constructed from two identical Halin graphs without any shift along the skirting cycle. We establish hamiltonicity of amalagams constructed from cubic Halin graphs. We give a sufficient condition for hamiltonicity of non-cubic amalgams and characterize infinite classes of non-Hamiltonian amalgams. We also characterize hamiltonicity of amalgams constructed by shifting the component Halin graphs by one and of general amalgams of higher degree. Received: June 23, 1997 |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |