## On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance

- Shih-Yan Chen, Shin-Shin Kao, Hsun Su
- Discrete Mathematics & Theoretical Computer…
- 2016

Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such thatG− v is hamiltonian for any vertex v of G, B the set of graphs G in U such thatG− 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… (More)