AbstractThomassen conjectured that every longest circuit of a 3-connected graph has a chord. The conjecture is verified in this paper for projective planar graphs with minimum degree at least 4
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractThe circumference of a graphGis the length of a longest cycle inG. In this paper, we shall s...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
This thesis is on a long standing open conjecture proposed by one of the most prominent mathematicia...
This thesis is on a long standing open conjecture proposed by one of the most prominent mathematicia...
This thesis is on a long standing open conjecture proposed by one of the most prominent mathematicia...
AbstractThomassen conjectured that every longest circuit of a 3-connected graph has a chord. The con...
AbstractIt was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math...
AbstractWe verify a conjecture of J. A. Bondy and M. Simonovits (Canad. J. Math. 32, No. 4 (1980), 9...
AbstractWe describe a general sufficient condition for a Hamiltonian graph to contain another Hamilt...
AbstractMoon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, th...
We verify two special cases of Thomassen’s conjecture of 1976 stating that every longest cycle in a ...
We verify two special cases of Thomassen’s conjecture of 1976 stating that every longest cycle in a ...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
AbstractJackson and Wormald showed that every 3-connected planar graph G contains a Tutte cycle C su...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractThe circumference of a graphGis the length of a longest cycle inG. In this paper, we shall s...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
This thesis is on a long standing open conjecture proposed by one of the most prominent mathematicia...
This thesis is on a long standing open conjecture proposed by one of the most prominent mathematicia...
This thesis is on a long standing open conjecture proposed by one of the most prominent mathematicia...
AbstractThomassen conjectured that every longest circuit of a 3-connected graph has a chord. The con...
AbstractIt was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math...
AbstractWe verify a conjecture of J. A. Bondy and M. Simonovits (Canad. J. Math. 32, No. 4 (1980), 9...
AbstractWe describe a general sufficient condition for a Hamiltonian graph to contain another Hamilt...
AbstractMoon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, th...
We verify two special cases of Thomassen’s conjecture of 1976 stating that every longest cycle in a ...
We verify two special cases of Thomassen’s conjecture of 1976 stating that every longest cycle in a ...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
AbstractJackson and Wormald showed that every 3-connected planar graph G contains a Tutte cycle C su...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractThe circumference of a graphGis the length of a longest cycle inG. In this paper, we shall s...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
DOI
Add to ORKG