For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length at least (1/36)c+(20/3) through any four vertices of G
It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractIt was shown by Chen and Yu that every 3-connected planar graph G contains a cycle of length...
For a 3-connected planar graph G with circumference c 44 it is proved that G has a cycle of length ...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
Let G be a 4-connected planar graph on n vertices. Previous results show that G contains a cycle of ...
Let G be a 4-connected planar graph on n vertices. Previous results show that G contains a cycle of ...
AbstractLet G be a 4-connected planar graph on n vertices. Previous results show that G contains a c...
We establish that if A is a set of at most 23 vertices in a 3-connected cubic planar graph G, then t...
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a pol...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractIt was shown by Chen and Yu that every 3-connected planar graph G contains a cycle of length...
For a 3-connected planar graph G with circumference c 44 it is proved that G has a cycle of length ...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length...
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
Let G be a 4-connected planar graph on n vertices. Previous results show that G contains a cycle of ...
Let G be a 4-connected planar graph on n vertices. Previous results show that G contains a cycle of ...
AbstractLet G be a 4-connected planar graph on n vertices. Previous results show that G contains a c...
We establish that if A is a set of at most 23 vertices in a 3-connected cubic planar graph G, then t...
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a pol...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractIt was shown by Chen and Yu that every 3-connected planar graph G contains a cycle of length...
DOI
Add to ORKG