Hypohamiltonian Planar Cubic Graphs with Girth 5

被引：7
|
作者：
McKay, Brendan D. [1 ]
机构：
[1] Australian Natl Univ, Canberra, ACT, Australia
来源：
JOURNAL OF GRAPH THEORY | 2017年 / 85卷 / 01期
关键词：
graph generation; hypohamiltonian graph; planar graph; cubic graph; HYPOTRACEABLE GRAPHS;
D O I：
10.1002/jgt.22043
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is called hypohamiltonian if it is not hamiltonian but becomes hamiltonian if any vertex is removed. Many hypohamiltonian planar cubic graphs have been found, starting with constructions of Thomassen in 1981. However, all the examples found until now had 4-cycles. In this note we present the first examples of hypohamiltonian planar cubic graphs with cyclic connectivity 5, and thus girth 5. We show by computer search that the smallest members of this class are three graphs with 76 vertices. (C) 2016 Wiley Periodicals, Inc.
引用
收藏
页码：7 / 11
页数：5
相关论文
共 50 条
  • [31] Acyclic 4-choosability of planar graphs with girth at least 5
    Montassier, Mickael
    Graph Theory in Paris: PROCEEDINGS OF A CONFERENCE IN MEMORY OF CALUDE BERGE, 2007, : 299 - 310
  • [32] Planar graphs with girth at least 5 are (3,4)-colorable
    Choi, Ilkyoo
    Yu, Gexin
    Zhang, Xia
    DISCRETE MATHEMATICS, 2019, 342 (12)
  • [33] A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable
    Miao Zhang
    Min Chen
    Yiqiao Wang
    Journal of Combinatorial Optimization, 2017, 33 : 847 - 865
  • [34] On universal graphs for planar oriented graphs of a given girth
    Borodin, OV
    Kostochka, AV
    Nesetril, J
    Raspaud, A
    Sopena, E
    DISCRETE MATHEMATICS, 1998, 188 (1-3) : 73 - 85
  • [35] Generation of Cubic Graphs and Snarks with Large Girth
    Brinkmann, Gunnar
    Goedgebeur, Jan
    JOURNAL OF GRAPH THEORY, 2017, 86 (02) : 255 - 272
  • [36] FRACTIONAL COLORINGS OF CUBIC GRAPHS WITH LARGE GIRTH
    Kardos, Frantisek
    Kral', Daniel
    Volec, Jan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (03) : 1454 - 1476
  • [37] Domination number of cubic graphs with large girth
    Kral', Daniel
    Skoda, Petr
    Volec, Jan
    JOURNAL OF GRAPH THEORY, 2012, 69 (02) : 131 - 142
  • [38] Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
    Kardos, Frantisek
    Kral', Daniel
    Volec, Jan
    RANDOM STRUCTURES & ALGORITHMS, 2012, 41 (04) : 506 - 520
  • [39] Neighbor sum distinguishing total colorings of planar graphs with girth at least 5
    Li, Jianguo
    Ge, Shan
    Xu, Changqing
    UTILITAS MATHEMATICA, 2017, 104 : 115 - 121
  • [40] A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable
    Zhang, Ganchao
    Chen, Min
    Wang, Weifan
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 474
12345