AbstractHerz, Duby and Vigué [9] conjectured that every hypohamiltonian graph has girth ⩾ 5. In the present note hypohamiltonian graphs of girth 3 and 4 are described. Also two conjectures on hypohamiltonian graphs made by Bondy and Chvátal, respectively, are disproved
AbstractChvátal raised the question whether or not planar hypohamiltonian graphs exist and Grünbaum ...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
AbstractGirth pairs were introduced by Harary and Kovács [Regular graphs with given girth pair, J. G...
AbstractHerz, Duby and Vigué [9] conjectured that every hypohamiltonian graph has girth ⩾ 5. In the ...
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...
The purpose of this paper is to prove that all graphs G,(m,n) defined by Doyen and Van Diest are hyp...
A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a H...
In (J Graph Theory 33 (2000), 14-24), Hell and Zhu proved that if a series-parallel graph G has girt...
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...
summary:The girth of graphs on Weyl groups, with no restriction on the associated root system, is de...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
Hamiltonian graphs are a very interesting research subject in the field of graph theory, which is th...
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 ...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
AbstractGirth pairs were introduced by Harary and Kovács [Regular graphs with given girth pair, J. G...
AbstractHerz, Duby and Vigué [9] conjectured that every hypohamiltonian graph has girth ⩾ 5. In the ...
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...
The purpose of this paper is to prove that all graphs G,(m,n) defined by Doyen and Van Diest are hyp...
A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a H...
In (J Graph Theory 33 (2000), 14-24), Hell and Zhu proved that if a series-parallel graph G has girt...
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...
summary:The girth of graphs on Weyl groups, with no restriction on the associated root system, is de...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
Hamiltonian graphs are a very interesting research subject in the field of graph theory, which is th...
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 ...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
AbstractGirth pairs were introduced by Harary and Kovács [Regular graphs with given girth pair, J. G...
DOI
Add to ORKG