AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, thus extending results of Lederberg, Butler, Goodey, Wegner, Okamura, and Barnette. Furthermore, the only non-hamiltonian examples on 38 vertices which are not cyclically 4-connected are the six graphs which have been found by Lederberg, Barnette, and Bosák
In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will g...
AbstractIt is shown that for every value of an integer k, k⩾11, there exist 3-valent 3-connected pla...
Tutte produced the first example of a 3-connected cubic planar nonhamiltonian graph. On adding the c...
AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, th...
AbstractWe show that 3-connected cubic bipartite planar graphs with fewer than 66 vertices are Hamil...
A conjecture of Barnette states that, every three connected cubic bipartite pla nar graph is Hamilto...
AbstractA non-hamiltonian cyclically 4-edge-connected bicubic graph with 54 vertices is constructed....
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number ...
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number ...
In this paper, we explore minimal k-connected non-Hamiltonian graphs. Graphs are said to be minimal ...
Thomassen showed in 1978 that every planar hypohamiltonian graph contains a cubic vertex. Equivalent...
Thomassen showed in 1978 that every planar hypohamiltonian graph contains a cubic vertex. Equivalent...
Barnette’s conjecture states that every three connected cubic bipartite planar graph (CPB3C) is Hami...
A 2-connected non-hamiltonian graph G is a k-graph if for exactly k < |V(G)| vertices in G, removing...
AbstractThis paper is concerned with non-Hamiltonian planar graphs. It is shown that the class of 3-...
In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will g...
AbstractIt is shown that for every value of an integer k, k⩾11, there exist 3-valent 3-connected pla...
Tutte produced the first example of a 3-connected cubic planar nonhamiltonian graph. On adding the c...
AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, th...
AbstractWe show that 3-connected cubic bipartite planar graphs with fewer than 66 vertices are Hamil...
A conjecture of Barnette states that, every three connected cubic bipartite pla nar graph is Hamilto...
AbstractA non-hamiltonian cyclically 4-edge-connected bicubic graph with 54 vertices is constructed....
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number ...
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number ...
In this paper, we explore minimal k-connected non-Hamiltonian graphs. Graphs are said to be minimal ...
Thomassen showed in 1978 that every planar hypohamiltonian graph contains a cubic vertex. Equivalent...
Thomassen showed in 1978 that every planar hypohamiltonian graph contains a cubic vertex. Equivalent...
Barnette’s conjecture states that every three connected cubic bipartite planar graph (CPB3C) is Hami...
A 2-connected non-hamiltonian graph G is a k-graph if for exactly k < |V(G)| vertices in G, removing...
AbstractThis paper is concerned with non-Hamiltonian planar graphs. It is shown that the class of 3-...
In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will g...
AbstractIt is shown that for every value of an integer k, k⩾11, there exist 3-valent 3-connected pla...
Tutte produced the first example of a 3-connected cubic planar nonhamiltonian graph. On adding the c...
DOI
Add to ORKG