 Author
 Carol Zamfirescu (UGent)
 Organization
 Abstract
 Thomassen showed in 1978 that every planar hypohamiltonian graph contains a cubic vertex. Equivalently, a planar graph with minimum degree at least 4 in which every vertex‐deleted subgraph is hamiltonian, must be itself hamiltonian. By applying work of Brinkmann and the author, we extend this result in three directions. We prove that (i) every planar hypohamiltonian graph contains at least four cubic vertices, (ii) every planar almost hypohamiltonian graph contains a cubic vertex, which is not the exceptional vertex (solving a problem of the author raised in J. Graph Theory [79 (2015) 63–81]), and (iii) every hypohamiltonian graph with crossing number 1 contains a cubic vertex. Furthermore, we settle a recent question of Thomassen by proving that asymptotically the ratio of the minimum number of cubic vertices to the order of a planar hypohamiltonian graph vanishes.
 Keywords
 hypohamiltonian, planar, 3connected, 3cut, LONGEST PATHS
Downloads

(...).pdf
 full text
 
 UGent only
 
 
 611.01 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU8588698
 MLA
 Zamfirescu, Carol. “Cubic Vertices in Planar Hypohamiltonian Graphs.” JOURNAL OF GRAPH THEORY, vol. 90, no. 2, 2019, pp. 189–207.
 APA
 Zamfirescu, C. (2019). Cubic vertices in planar hypohamiltonian graphs. JOURNAL OF GRAPH THEORY, 90(2), 189–207.
 Chicago authordate
 Zamfirescu, Carol. 2019. “Cubic Vertices in Planar Hypohamiltonian Graphs.” JOURNAL OF GRAPH THEORY 90 (2): 189–207.
 Chicago authordate (all authors)
 Zamfirescu, Carol. 2019. “Cubic Vertices in Planar Hypohamiltonian Graphs.” JOURNAL OF GRAPH THEORY 90 (2): 189–207.
 Vancouver
 1.Zamfirescu C. Cubic vertices in planar hypohamiltonian graphs. JOURNAL OF GRAPH THEORY. 2019;90(2):189–207.
 IEEE
 [1]C. Zamfirescu, “Cubic vertices in planar hypohamiltonian graphs,” JOURNAL OF GRAPH THEORY, vol. 90, no. 2, pp. 189–207, 2019.
@article{8588698, abstract = {Thomassen showed in 1978 that every planar hypohamiltonian graph contains a cubic vertex. Equivalently, a planar graph with minimum degree at least 4 in which every vertex‐deleted subgraph is hamiltonian, must be itself hamiltonian. By applying work of Brinkmann and the author, we extend this result in three directions. We prove that (i) every planar hypohamiltonian graph contains at least four cubic vertices, (ii) every planar almost hypohamiltonian graph contains a cubic vertex, which is not the exceptional vertex (solving a problem of the author raised in J. Graph Theory [79 (2015) 63–81]), and (iii) every hypohamiltonian graph with crossing number 1 contains a cubic vertex. Furthermore, we settle a recent question of Thomassen by proving that asymptotically the ratio of the minimum number of cubic vertices to the order of a planar hypohamiltonian graph vanishes.}, author = {Zamfirescu, Carol}, issn = {03649024}, journal = {JOURNAL OF GRAPH THEORY}, keywords = {hypohamiltonian,planar,3connected,3cut,LONGEST PATHS}, language = {eng}, number = {2}, pages = {189207}, title = {Cubic vertices in planar hypohamiltonian graphs}, url = {http://dx.doi.org/10.1002/jgt.22388}, volume = {90}, year = {2019}, }
 Altmetric
 View in Altmetric
 Web of Science
 Times cited: