Planar and infinite hypohamiltonian and hypotraceable graphs

DOI10.1016/0012-365X(76)90071-6zbMath0322.05130WikidataQ56001741 ScholiaQ56001741MaRDI QIDQ1223315

Carsten Thomassen

Publication date: 1976

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Grinberg's criterion ⋮ Nonempty intersection of longest paths in \(2K_2\)-free graphs ⋮ On non-traceable, non-hypotraceable, arachnoid graphs ⋮ Graph-theoretical conditions for inscribability and Delaunay realizability ⋮ Forbidden configurations for hypohamiltonian graphs ⋮ Every 4-Connected Graph with Crossing Number 2 is Hamiltonian ⋮ Characterization and enumeration of hypotraversable graphs ⋮ Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ On minimum leaf spanning trees and a criticality notion ⋮ Intersecting longest paths ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Planar Hypohamiltonian Graphs on 40 Vertices ⋮ Intersecting longest paths in chordal graphs ⋮ Intersecting longest cycles in Archimedean tilings ⋮ Bounding the distance among longest paths in a connected graph ⋮ K₂‐Hamiltonian graphs: II ⋮ Improved bounds for hypohamiltonian graphs ⋮ Leaf-Critical and Leaf-Stable Graphs ⋮ On planar hypohamiltonian graphs ⋮ On constructions of hypotraceable graphs ⋮ Intersection of longest paths in graph classes ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Nonempty intersection of longest paths in series-parallel graphs ⋮ Planar cubic hypohamiltonian and hypotraceable graphs ⋮ Ein planarer hypohamiltonscher Graph mit 57 Knoten ⋮ Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs ⋮ On Hypohamiltonian and Almost Hypohamiltonian Graphs ⋮ Regular non-Hamiltonian polyhedral graphs ⋮ $K_2$-Hamiltonian Graphs: I ⋮ Circuit preserving edge maps. II ⋮ The product of two high-frequency graph Laplacian eigenfunctions is smooth ⋮ Hypohamiltonian Planar Cubic Graphs with Girth 5

Cites Work

• Non-Hamiltonian cubic planar maps
• New families of hypohamiltonian graphs
• Parallel concepts in graph theory
• Hypohamiltonian and hypotraceable graphs
• On hypohamiltonian graphs
• Vertices missed by longest paths or circuits
• Polytopes, graphs, and complexes
• Flip-Flops in Hypohamiltonian Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item