Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs

On longest paths and circuits in graphs.

Tudor Zamfirescu · MATHEMATICA SCANDINAVICA · 1976 · 89 citations · Full text

Graph Algorithms, Graph Theory, Structural Graph Theory +3

A campanological problem in group theory

R. A. Rankin · Mathematical Proceedings of the Cambridge Philosophical Society · 1948 · 72 citations

Campanological Application, Representation Theory, Mathematical Basis +7

Vertices missed by longest paths or circuits

Branko Grünbaum · Journal of Combinatorial Theory Series A · 1974 · 62 citations

Geometric Graph Theory, Graph Theory, Planar Graph +7

A two-connected planar graph without concurrent longest paths

Tudor Zamfirescu · Journal of Combinatorial Theory Series B · 1972 · 51 citations

Geometric Graph Theory, Network Science, Graph Theory +8

When the cartesian product of two directed cycles is hypo‐Hamiltonian

Laurence E. Penn, David Witte · Journal of Graph Theory · 1983 · 18 citations

Quantum Materials, Directed Cycles, Hamiltonian System +2