AbstractThe circumference of a graphGis the length of a longest cycle inG. In this paper, we shall show that, ifGis a 3-connected graph embeddable in the plane, the projective plane, the torus, or the Klein bottle, thenGhas circumference at least (1/6)×|V(G)|0.4+1. This improves a result of Jackson and Wormald
Karger, Motwani, and Ramkumar [Algorithmica, 18 (1997), pp. 82–98] have shown that there is no const...
Let G be a graph of order n satisfying d(u) + d(v) n for every edge uv of G. We show that the circum...
Abstract: Let G be a graph of order n satisfying d(u) + d(v) n for every edge uv of G. We show tha...
AbstractThe circumference of a graphGis the length of a longest cycle inG. In this paper, we shall s...
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ cont...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
AbstractLet C be a longest cycle in a connected graph G and L(G) the length of the longest path in G...
AbstractIt was shown by Chen and Yu that every 3-connected planar graph G contains a cycle of length...
Karger, Motwani and Ramkumar have shown that there is no constant approximation algorithm to find a ...
It was shown by Chen and Yu that every 3-connected planar graph G con-tains a cycle of length at lea...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
The circumference c(G) of a graph G is the length of a longest cycle. By exploit-ing our recent resu...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
Karger, Motwani, and Ramkumar [Algorithmica, 18 (1997), pp. 82–98] have shown that there is no const...
Let G be a graph of order n satisfying d(u) + d(v) n for every edge uv of G. We show that the circum...
Abstract: Let G be a graph of order n satisfying d(u) + d(v) n for every edge uv of G. We show tha...
AbstractThe circumference of a graphGis the length of a longest cycle inG. In this paper, we shall s...
AbstractThe circumference of a graph is the length of its longest cycles. Results of Jackson, and Ja...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ cont...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
AbstractLet C be a longest cycle in a connected graph G and L(G) the length of the longest path in G...
AbstractIt was shown by Chen and Yu that every 3-connected planar graph G contains a cycle of length...
Karger, Motwani and Ramkumar have shown that there is no constant approximation algorithm to find a ...
It was shown by Chen and Yu that every 3-connected planar graph G con-tains a cycle of length at lea...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
The circumference c(G) of a graph G is the length of a longest cycle. By exploit-ing our recent resu...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
Karger, Motwani, and Ramkumar [Algorithmica, 18 (1997), pp. 82–98] have shown that there is no const...
Let G be a graph of order n satisfying d(u) + d(v) n for every edge uv of G. We show that the circum...
Abstract: Let G be a graph of order n satisfying d(u) + d(v) n for every edge uv of G. We show tha...
DOI
Add to ORKG