Full metadata record
DC FieldValueLanguage
dc.contributor.authorKao, Shin-Shinen_US
dc.contributor.authorHsu, Kung-Mingen_US
dc.contributor.authorHsu, Lih-Hsingen_US
dc.date.accessioned2014-12-08T15:16:12Z-
dc.date.available2014-12-08T15:16:12Z-
dc.date.issued2006-07-06en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.disc.2005.08.011en_US
dc.identifier.urihttp://hdl.handle.net/11536/12038-
dc.description.abstractLet 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.language.isoen_USen_US
dc.subjectHamiltonianen_US
dc.subjectHamiltonian connecteden_US
dc.subjectplanar graphsen_US
dc.titleCubic planar Hamiltonian graphs of various typesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.disc.2005.08.011en_US
dc.identifier.journalDISCRETE MATHEMATICSen_US
dc.citation.volume306en_US
dc.citation.issue13en_US
dc.citation.spage1364en_US
dc.citation.epage1389en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000238851700011-
dc.citation.woscount5-
Appears in Collections:Articles


Files in This Item:

  1. 000238851700011.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.