Add to ORKGWe establish that if A is a set of at most 23 vertices in a 3-connected cubic planar graph G, then there is a cycle in G containing A. This result is sharp
AbstractThomassen recently proved, using the Tutte cycle technique, that if G is a 3-connected cubic...
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex pol...
AbstractA graph is called v-pancyclic if it contains a cycle of length l containing a given vertex v...
ABSTRACT. We show that in a %connected cubic planar graph a cycle can be found through any given 19 ...
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...
Merker conjectured that if k ≥ 2 is an integer and G a 3-connected cubic planar graph of circumferen...
AbstractWe verify a conjecture of J. A. Bondy and M. Simonovits (Canad. J. Math. 32, No. 4 (1980), 9...
AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, th...
AbstractLetf(n) be the minimum number of cycles present in a 3-connected cubic graph onnvertices. In...
This note complements results on cycle spectra of planar graphs by investigating the toroidal case. ...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
AbstractA 3-valent graph G is cyclically n-connected provided one must cut at least n edges in order...
AbstractLet G be a 3-connected simple cubic graph on n≥8 vertices. It is proved in this paper that G...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractThomassen recently proved, using the Tutte cycle technique, that if G is a 3-connected cubic...
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex pol...
AbstractA graph is called v-pancyclic if it contains a cycle of length l containing a given vertex v...
ABSTRACT. We show that in a %connected cubic planar graph a cycle can be found through any given 19 ...
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...
Merker conjectured that if k ≥ 2 is an integer and G a 3-connected cubic planar graph of circumferen...
AbstractWe verify a conjecture of J. A. Bondy and M. Simonovits (Canad. J. Math. 32, No. 4 (1980), 9...
AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, th...
AbstractLetf(n) be the minimum number of cycles present in a 3-connected cubic graph onnvertices. In...
This note complements results on cycle spectra of planar graphs by investigating the toroidal case. ...
AbstractWe give lower bounds on the length of a longest cycle in a planar graph on n vertices which ...
AbstractA 3-valent graph G is cyclically n-connected provided one must cut at least n edges in order...
AbstractLet G be a 3-connected simple cubic graph on n≥8 vertices. It is proved in this paper that G...
AbstractThe length of a longest cycle in a graph G is called the circumference of G and is denoted b...
AbstractThomassen recently proved, using the Tutte cycle technique, that if G is a 3-connected cubic...
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex pol...
AbstractA graph is called v-pancyclic if it contains a cycle of length l containing a given vertex v...