AbstractInfinite families of planar cubic hypohamiltonian and hypotraceable graphs are described and these are used to prove that the maximum degree and the maximum number of edges in a hypohamiltonian graph with n vertices are approximately n2 and n24, respectively. Also, the possible order of a cubic hypohamiltonian graph is determined
Hamiltonian graphs are a very interesting research subject in the field of graph theory, which is th...
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. Th...
International audienceA digraph is \emph{traceable} if it has a path that visits every vertex. A dig...
In 1978 Thomassen asked whether planar hypohamiltonian oriented graphs exist. Infinite families of s...
AbstractChvátal raised the question whether or not planar hypohamiltonian graphs exist and Grünbaum ...
Thomassen showed in 1978 that every planar hypohamiltonian graph contains a cubic vertex. Equivalent...
A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a H...
A graph is called hypohamiltonian if it is not hamiltonian but becomes hamiltonian if any vertex is ...
A graph G is hypohamiltonian if G is non-hamiltonian and for every vertex v in G, the graph G-v is h...
A graph G is hypohamiltonian if G is non-hamiltonian and G - nu is hamiltonian for every nu is an el...
A graph G is almost hypohamiltonian if G is non-hamiltonian, there exists a vertex w such that G-w i...
This Dissertation is structured as follows. In Chapter 1, we give a short historical overview and de...
The purpose of this paper is to prove that all graphs G,(m,n) defined by Doyen and Van Diest are hyp...
A graph G is almost hypohamiltonian (a.h.) if G is non-hamiltonian, there exists a vertex w in G suc...
The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit p...
Hamiltonian graphs are a very interesting research subject in the field of graph theory, which is th...
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. Th...
International audienceA digraph is \emph{traceable} if it has a path that visits every vertex. A dig...
In 1978 Thomassen asked whether planar hypohamiltonian oriented graphs exist. Infinite families of s...
AbstractChvátal raised the question whether or not planar hypohamiltonian graphs exist and Grünbaum ...
Thomassen showed in 1978 that every planar hypohamiltonian graph contains a cubic vertex. Equivalent...
A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a H...
A graph is called hypohamiltonian if it is not hamiltonian but becomes hamiltonian if any vertex is ...
A graph G is hypohamiltonian if G is non-hamiltonian and for every vertex v in G, the graph G-v is h...
A graph G is hypohamiltonian if G is non-hamiltonian and G - nu is hamiltonian for every nu is an el...
A graph G is almost hypohamiltonian if G is non-hamiltonian, there exists a vertex w such that G-w i...
This Dissertation is structured as follows. In Chapter 1, we give a short historical overview and de...
The purpose of this paper is to prove that all graphs G,(m,n) defined by Doyen and Van Diest are hyp...
A graph G is almost hypohamiltonian (a.h.) if G is non-hamiltonian, there exists a vertex w in G suc...
The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit p...
Hamiltonian graphs are a very interesting research subject in the field of graph theory, which is th...
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. Th...
International audienceA digraph is \emph{traceable} if it has a path that visits every vertex. A dig...
DOI
Add to ORKG