AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degree at least d has a basis consisting of cycles of length at least 2d−1. In this paper, we prove a similar result for a large class of hamiltonian graphs. We also prove a generalization of a result of I. Hartman
AbstractMoon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, th...
AbstractFor a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, re...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at le...
AbstractLet G be a graph of order n, σk = min{ϵi=1kd(νi): {ν1,…, νk} is an independent set of vertic...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractBondy conjectured a common generalization of various results in hamiltonian graph theory con...
AbstractA cycle of C of a graph G is called a Dλ-cycle if every component of G − V(C) has order less...
A cycle of C of a graph G is called a Dλ-cycle if every component of G − V(C) has order less than λ....
Planar fundamental cycle basis belong to a 2-connected simple graph is used for enumerating Hamilto...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
AbstractThis paper is concerned with bridges of longest cycles in 3-connected non-hamiltonian graphs...
AbstractMoon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, th...
AbstractFor a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, re...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at le...
AbstractLet G be a graph of order n, σk = min{ϵi=1kd(νi): {ν1,…, νk} is an independent set of vertic...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractBondy conjectured a common generalization of various results in hamiltonian graph theory con...
AbstractA cycle of C of a graph G is called a Dλ-cycle if every component of G − V(C) has order less...
A cycle of C of a graph G is called a Dλ-cycle if every component of G − V(C) has order less than λ....
Planar fundamental cycle basis belong to a 2-connected simple graph is used for enumerating Hamilto...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
AbstractThis paper is concerned with bridges of longest cycles in 3-connected non-hamiltonian graphs...
AbstractMoon and Moser in 1963 conjectured that if G is a 3-connected planar graph on n vertices, th...
AbstractFor a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, re...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
DOI
Add to ORKG