10 citations · 11 across the 3 of their papers we have counts for
5 papers
Few hamiltonian cycles in graphs with one or two vertex degrees
Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo +2
We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct…
Counterexamples to a conjecture of Merker on 3-connected cubic planar graphs with a large cycle spectrum gap
Carol T. Zamfirescu
Merker conjectured that if is an integer and a 3-connected cubic planar graph of circumference at least , then the set of cycle lengths of must contain at leas…
Long Cycles and Spanning Subgraphs of Locally Maximal 1-planar Graphs
Igor Fabrici, Jochen Harant, Tomáš Madaras +3
A graph is -planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for e…
Graphs with few Hamiltonian Cycles
Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number of hamiltonian cycles, which is especially efficient for small . Ou…
Structural and computational results on platypus graphs
Jan Goedgebeur, Addie Neyt, Carol T. Zamfirescu
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions r…