AbstractThis paper is concerned with bridges of longest cycles in 3-connected non-hamiltonian graphs. Let G be such a graph and let d(u)+d(υ)⩾m for each pair of non-adjacent vertices u and υ. Let the length of its longest cycle C be r. Then the length of any bridge of G is at most r-m+2
AbstractAny pair of vertices in a 4-connected non-bipartite k-regular graph are joined by a Hamilton...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
AbstractIn this paper, we study triangle-free graphs. Let G=(V,E) be an arbitrary triangle-free grap...
AbstractThis paper is concerned with bridges of longest cycles in 3-connected non-hamiltonian graphs...
AbstractFor a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, re...
AbstractFor a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, re...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
AbstractIt is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractWe describe a general sufficient condition for a Hamiltonian graph to contain another Hamilt...
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...
AbstractWe verify a conjecture of J. A. Bondy and M. Simonovits (Canad. J. Math. 32, No. 4 (1980), 9...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
AbstractWe show how to find in Hamiltonian graphs a cycle of length nΩ(1/loglogn)=exp(Ω(logn/loglogn...
AbstractLet C be a longest cycle in a connected graph G and L(G) the length of the longest path in G...
AbstractAny pair of vertices in a 4-connected non-bipartite k-regular graph are joined by a Hamilton...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
AbstractIn this paper, we study triangle-free graphs. Let G=(V,E) be an arbitrary triangle-free grap...
AbstractThis paper is concerned with bridges of longest cycles in 3-connected non-hamiltonian graphs...
AbstractFor a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, re...
AbstractFor a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, re...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
AbstractIt is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractWe describe a general sufficient condition for a Hamiltonian graph to contain another Hamilt...
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...
AbstractWe verify a conjecture of J. A. Bondy and M. Simonovits (Canad. J. Math. 32, No. 4 (1980), 9...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
AbstractWe show how to find in Hamiltonian graphs a cycle of length nΩ(1/loglogn)=exp(Ω(logn/loglogn...
AbstractLet C be a longest cycle in a connected graph G and L(G) the length of the longest path in G...
AbstractAny pair of vertices in a 4-connected non-bipartite k-regular graph are joined by a Hamilton...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
AbstractIn this paper, we study triangle-free graphs. Let G=(V,E) be an arbitrary triangle-free grap...
DOI
Add to ORKG