AbstractWe prove the result stated in the title (conjectured by Grünbaum) and a conjecture of Plummer that every graph which can be obtained from a 4-connected planar graph by deleting two vertices is Hamiltonian. The proofs are constructive and give rise to polynomial-time algorithms
AbstractIt is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is...
A graph $G$ is said to be \textit{$4$-ordered} if for any ordered set of four distinct vertices of $...
A graph $G$ is said to be \textit{$4$-ordered} if for any ordered set of four distinct vertices of $...
AbstractWe prove the result stated in the title (conjectured by Grünbaum) and a conjecture of Plumme...
Abstract. A graph is hamiltonian if it has a hamiltonian cycle. It is well-known that Tutte proved t...
Tutte proved that every planar 4-connected graph is hamiltonian. Thomassen showed that the same conc...
AbstractIn 1956, W.T. Tutte proved that every 4-connected planar graph is hamiltonian. Moreover, in ...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
AbstractThomassen conjectured that every 4-connected line graph is Hamiltonian. Lai et al. conjectur...
The author has investigated the properties of Hamiltonian circuits in a class of trivalent planar gr...
AbstractIn 1956, W.T. Tutte proved that every 4-connected planar graph is hamiltonian. Moreover, in ...
AbstractThis paper describes a linear time algorithm to find a Hamiltonian cycle in an arbitrary 4-c...
The author has investigated the properties of Hamiltonian circuits in a class of trivalent planar gr...
The author has investigated the properties of Hamiltonian circuits in a class of trivalent planar gr...
Back in the eighties, Heath [Algorithms for embedding graphs in books. PhD thesis, University of Nor...
AbstractIt is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is...
A graph $G$ is said to be \textit{$4$-ordered} if for any ordered set of four distinct vertices of $...
A graph $G$ is said to be \textit{$4$-ordered} if for any ordered set of four distinct vertices of $...
AbstractWe prove the result stated in the title (conjectured by Grünbaum) and a conjecture of Plumme...
Abstract. A graph is hamiltonian if it has a hamiltonian cycle. It is well-known that Tutte proved t...
Tutte proved that every planar 4-connected graph is hamiltonian. Thomassen showed that the same conc...
AbstractIn 1956, W.T. Tutte proved that every 4-connected planar graph is hamiltonian. Moreover, in ...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
AbstractThomassen conjectured that every 4-connected line graph is Hamiltonian. Lai et al. conjectur...
The author has investigated the properties of Hamiltonian circuits in a class of trivalent planar gr...
AbstractIn 1956, W.T. Tutte proved that every 4-connected planar graph is hamiltonian. Moreover, in ...
AbstractThis paper describes a linear time algorithm to find a Hamiltonian cycle in an arbitrary 4-c...
The author has investigated the properties of Hamiltonian circuits in a class of trivalent planar gr...
The author has investigated the properties of Hamiltonian circuits in a class of trivalent planar gr...
Back in the eighties, Heath [Algorithms for embedding graphs in books. PhD thesis, University of Nor...
AbstractIt is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is...
A graph $G$ is said to be \textit{$4$-ordered} if for any ordered set of four distinct vertices of $...
A graph $G$ is said to be \textit{$4$-ordered} if for any ordered set of four distinct vertices of $...
DOI
Add to ORKG