標題: Cubic planar Hamiltonian graphs of various types
作者: Kao, Shin-Shin
Hsu, Kung-Ming
Hsu, Lih-Hsing
應用數學系
Department of Applied Mathematics
關鍵字: Hamiltonian;Hamiltonian connected;planar graphs
公開日期: 6-七月-2006
摘要: Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such that G - upsilon is hantiltonian for any vertex upsilon of G, B the set of graphs G in U such that G - e is hamiltonian for any edge e of G, and C the set of graphs G in U such that there is a hamiltonian path between any two different vertices of G. With the inclusion and/or exclusion of the sets A, B, and C, U is divided into eight subsets. In this paper, we prove that there is an infinite number of graphs in each of the eight subsets. (c) 2006 Elsevier B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/j.disc.2005.08.011
http://hdl.handle.net/11536/12038
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.08.011
期刊: DISCRETE MATHEMATICS
Volume: 306
Issue: 13
起始頁: 1364
結束頁: 1389
顯示於類別:期刊論文


文件中的檔案:

  1. 000238851700011.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。