A construction of a $\frac{3}{2}$-tough plane triangulation with no 2-factor
Abstract: In 1956, Tutte proved the celebrated theorem that every 4-connected planar graph is hamiltonian. This result implies that every more than $\frac{3}{2}$-tough planar graph on at least three vertices is hamiltonian and so has a 2-factor. Owens in 1999 constructed non-hamiltonian maximal planar graphs of toughness arbitrarily close to $\frac{3}{2}$ and asked whether there exists a maximal non-hamiltonian planar graph of toughness exactly $\frac{3}{2}$. In fact, the graphs Owens constructed do not even contain a 2-factor. Thus the toughness of exactly $\frac{3}{2}$ is the only case left in asking the existence of 2-factors in tough planar graphs. This question was also asked by Bauer, Broersma, and Schmeichel in a survey. In this paper, we close this gap by constructing a maximal $\frac{3}{2}$-tough plane graph with no 2-factor, answering the question asked by Owens as well as by Bauer, Broersma, and Schmeichel.
- Not every 2-tough graph is Hamiltonian. Discret. Appl. Math. , 99(1-3): 317–321, 2000.
- Toughness in graphs – a survey. Graphs and Combinatorics, 22(1):1–35, 2006.
- C. Berge. Sur le couplage maximum d’un graphe. C. R. Acad. Sci. Paris, 247:258–259, 1958.
- V. Chvátal. Tough graphs and Hamiltonian circuits. Discrete Math., 5:215–228, 1973.
- M. B. Dillencourt. An upper bound on the shortness exponent of 1111-tough, maximal planar graphs. Discrete Math., 90(1):93–97, 1991.
- M. B. Dillencourt. On the toughness index of planar graphs. J. Graph Theory, 18(1):103–107, 1994.
- J. Harant and P. J. Owens. Non-Hamiltonian 5454\frac{5}{4}divide start_ARG 5 end_ARG start_ARG 4 end_ARG-tough maximal planar graphs. Discrete Math., 147(1-3):301–305, 1995.
- J. Kanno and S. Shan. Vizing’s 2-factor conjecture involving toughness and maximum degree conditions. Electron. J. Combin., 26(2):P2.17, 2019.
- P. J. Owens. Non-Hamiltonian maximal planar graphs with high toughness. Tatra Mt. Math. Publ., 18: 89–103, 1999.
- M. Tkáč. On the shortness exponent of 1111-tough, maximal planar graphs. Discrete Math., 154(1-3):321–328, 1996.
- W. T. Tutte. The factorization of linear graphs. J. London Math. Soc., 22:107–111, 1947.
- W. T. Tutte. The factors of graphs. Canadian J. Math., 4:314–328, 1952.
- W. T. Tutte. A theorem on planar graphs. Trans. Amer. Math. Soc., 82:99–116, 1956.
- D. B. West. A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem. European J. Combin., 32(5):674–676, 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.