In graph theory and graph drawing, a subhamiltonian graph is a subgraph of a planar Hamiltonian graph. A graph G is subhamiltonian if G is a subgraph...
6 KB (641 words) - 02:35, 3 January 2024
Hamiltonian path (redirect from Hamiltonian graph)
permutohedron Subhamiltonian graph, a subgraph of a planar Hamiltonian graph Tait's conjecture (now known false) that 3-regular polyhedral graphs are Hamiltonian...
19 KB (2,043 words) - 13:05, 14 May 2025
Book embedding (category Topological graph theory)
complete graphs. The graphs with book thickness one are the outerplanar graphs. The graphs with book thickness at most two are the subhamiltonian graphs, which...
68 KB (8,167 words) - 00:16, 5 October 2024
Arc diagram (category Graph drawing)
is only possible for the subhamiltonian graphs, a proper subset of the planar graphs. For instance, a maximal planar graph has such an embedding if and...
22 KB (2,597 words) - 02:23, 31 March 2025
Simultaneous embedding (category Graph drawing)
grid of polynomial area, with at most two bends per edge. Any two subhamiltonian graphs have a simultaneous embedding with at most one bend per edge. Bläsius...
13 KB (1,651 words) - 07:38, 22 July 2024