Cubic planar hamiltonian graphs of various types

Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such that G-v is hamiltonian for any vertex v 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.

[1]  Lih-Hsing Hsu,et al.  Ring embedding in faulty pancake graphs , 2003, Inf. Process. Lett..

[2]  Jimmy J. M. Tan,et al.  Fault-Tolerant Hamiltonicity of Twisted Cubes , 2002, J. Parallel Distributed Comput..

[3]  John P. Hayes,et al.  Edge fault tolerance in graphs , 1993, Networks.

[4]  Jimmy J. M. Tan,et al.  Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs , 2004, IEEE Transactions on Computers.

[5]  G. Winskel.  What Is Discrete Mathematics , 2007 .

[6]  Jimmy J. M. Tan,et al.  Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)‐star graphs , 2003, Networks.

[7]  Bhabani P. Sinha,et al.  Hamiltonian Graphs with Minimum Number of Edges for Fault-Tolerant Topologies , 1992, Inf. Process. Lett..

[8]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[9]  Derek Allan Holton,et al.  The Petersen graph , 1993, Australian mathematical society lecture series.

[10]  Jimmy J. M. Tan,et al.  On the Fault-Tolerant Hamiltonicity of Faulty Crossed Cubes , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[11]  Jimmy J. M. Tan,et al.  Construction schemes for fault-tolerant Hamiltonian graphs , 2000, Networks.

[12]  Frank Harary,et al.  Graph Theory , 2016 .

[13]  Jimmy J. M. Tan,et al.  Hamiltonian Properties of Faulty Recursive Circulant Graphs , 2002, J. Interconnect. Networks.

[14]  John P. Hayes,et al.  Node fault tolerance in graphs , 1996, Networks.