arXiv (All)
open access
Non-Hamiltonian $\frac{3}{2}$-Tough Plane Triangulations
By Tutte's classic theorem of 1956 that every 4-connected planar graph is Hamiltonian, every planar graph of order at least three with toughness greater than $\frac{3}{2}$ is Hamiltonian. In 1999, Owens constructed a sequence of maximal planar graphs whose toughness approaches $\frac{3}{2}$ from bel
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A complete classification of metrizable and strictly metrizable theta graphs#987710
- A second eight-faced polyhedron in which every two faces share an edge#1117710
- On the minimum number of triangles in balanced tripartite graphs with large minimum degree#1034400
- Kitaev model in regular hyperbolic tilings#1079636
- Sistema Experto en Deducción dentro de la Lógica Normal Trivalente#735807
Record · ID 972337
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive