DOIAbstract
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
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
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
AbstractWe prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle wit...
AbstractKnown estimates of the maximal length of simple circuits in certain 3-connected planar graph...
AbstractIt was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math...
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...
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...
AbstractWe describe a general sufficient condition for a Hamiltonian graph to contain another Hamilt...
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 ...
AbstractSmith conjectured that two distinct longest cycles of a k-connected graph meet in at least k...
AbstractJackson and Wormald showed that every 3-connected planar graph G contains a Tutte cycle C su...
AbstractWe prove the conjecture of Jackson and Wormald that every 3-connected planar graph has a clo...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
AbstractWe prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle wit...
AbstractKnown estimates of the maximal length of simple circuits in certain 3-connected planar graph...
AbstractIt was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math...
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...
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...
AbstractWe describe a general sufficient condition for a Hamiltonian graph to contain another Hamilt...
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 ...
AbstractSmith conjectured that two distinct longest cycles of a k-connected graph meet in at least k...
AbstractJackson and Wormald showed that every 3-connected planar graph G contains a Tutte cycle C su...
AbstractWe prove the conjecture of Jackson and Wormald that every 3-connected planar graph has a clo...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
AbstractWe prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle wit...
AbstractKnown estimates of the maximal length of simple circuits in certain 3-connected planar graph...
Add to ORKG