Cubic planar Hamiltonian graphs of various types
| dc.citation.epage | 1389 | en_US |
| dc.citation.issue | 13 | en_US |
| dc.citation.spage | 1364 | en_US |
| dc.citation.volume | 306 | en_US |
| dc.citation.woscount | 5 | |
| dc.contributor.author | Kao, Shin-Shin | en_US |
| dc.contributor.author | Hsu, Kung-Ming | en_US |
| dc.contributor.author | Hsu, Lih-Hsing | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:16:12Z | |
| dc.date.available | 2014-12-08T15:16:12Z | |
| dc.date.issued | 2006-07-06 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.doi | 10.1016/j.disc.2005.08.011 | en_US |
| dc.identifier.issn | 0012-365X | en_US |
| dc.identifier.journal | DISCRETE MATHEMATICS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.disc.2005.08.011 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/12038 | |
| dc.identifier.wosnumber | WOS:000238851700011 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Hamiltonian | en_US |
| dc.subject | Hamiltonian connected | en_US |
| dc.subject | planar graphs | en_US |
| dc.title | Cubic planar Hamiltonian graphs of various types | en_US |
| dc.type | Article | en_US |