AbstractWe verify a conjecture of J. A. Bondy and M. Simonovits (Canad. J. Math. 32, No. 4 (1980), 987–992) by showing that there exists a constant c > 0 such that every 3-connected cubic graph G has a cycle of length at least |G|c
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
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...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractIt is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a...
AbstractLetf(n) be the minimum number of cycles present in a 3-connected cubic graph onnvertices. In...
AbstractThomassen conjectured that every longest circuit of a 3-connected graph has a chord. The con...
AbstractMoon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, th...
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...
Karger, Motwani and Ramkumar have shown that there is no constant approximation algorithm to find a ...
Karger, Motwani, and Ramkumar [Algorithmica, 18 (1997), pp. 82–98] have shown that there is no const...
AbstractIn this paper, we get the following result: Let G be a 3-connected graph with n vertices. Th...
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
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...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractIt is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a...
AbstractLetf(n) be the minimum number of cycles present in a 3-connected cubic graph onnvertices. In...
AbstractThomassen conjectured that every longest circuit of a 3-connected graph has a chord. The con...
AbstractMoon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, th...
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...
Karger, Motwani and Ramkumar have shown that there is no constant approximation algorithm to find a ...
Karger, Motwani, and Ramkumar [Algorithmica, 18 (1997), pp. 82–98] have shown that there is no const...
AbstractIn this paper, we get the following result: Let G be a 3-connected graph with n vertices. Th...
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
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...
DOI
Add to ORKG