AbstractIn this note, we show that every 5-connected triangulation in a surface with sufficiently large representativity is Hamiltonian-connected
We prove that 3-connected plane triangulations containing a single edge contained in all separating ...
We prove that 3-connected plane triangulations containing a single edge contained in all separating ...
We prove that 3-connected plane triangulations containing a single edge contained in all separating ...
AbstractIn this note, we show that every 5-connected triangulation in a surface with sufficiently la...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
Abstract. We study the existence of certain disjoint paths in planar graphs and generalize a theorem...
AbstractWe prove that every edge in a 5-connected graph embedded in the torus is contained in a Hami...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
AbstractIn 1956, W.T. Tutte proved that every 4-connected planar graph is hamiltonian. Moreover, in ...
AbstractTutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and ...
AbstractWe prove that for every 5-connected plane triangulation T, and for every set A of facial cyc...
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Wil...
AbstractWe prove that for every 5-connected plane triangulation T, and for every set A of facial cyc...
AbstractIn 1956, W.T. Tutte proved that a 4-connected planar graph is hamiltonian. Moreover, in 1997...
AbstractThomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. ...
We prove that 3-connected plane triangulations containing a single edge contained in all separating ...
We prove that 3-connected plane triangulations containing a single edge contained in all separating ...
We prove that 3-connected plane triangulations containing a single edge contained in all separating ...
AbstractIn this note, we show that every 5-connected triangulation in a surface with sufficiently la...
AbstractIn this paper we show that for eachnthere is a triangulation of an orientable surface which ...
Abstract. We study the existence of certain disjoint paths in planar graphs and generalize a theorem...
AbstractWe prove that every edge in a 5-connected graph embedded in the torus is contained in a Hami...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
AbstractIn 1956, W.T. Tutte proved that every 4-connected planar graph is hamiltonian. Moreover, in ...
AbstractTutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and ...
AbstractWe prove that for every 5-connected plane triangulation T, and for every set A of facial cyc...
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Wil...
AbstractWe prove that for every 5-connected plane triangulation T, and for every set A of facial cyc...
AbstractIn 1956, W.T. Tutte proved that a 4-connected planar graph is hamiltonian. Moreover, in 1997...
AbstractThomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. ...
We prove that 3-connected plane triangulations containing a single edge contained in all separating ...
We prove that 3-connected plane triangulations containing a single edge contained in all separating ...
We prove that 3-connected plane triangulations containing a single edge contained in all separating ...
DOI
Add to ORKG