AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-connected graphs G of order n⩾3, such that for all vertices x,y∈V(G) we haved(x,y)=2⇒max{d(x),d(y)}⩾n+k2and there is a k-matching M⊂G, (k⩾0) which is not contained in any Hamiltonian cycle of G
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
For an integer k \u3e 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-...
For a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G is comple...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
The aim of this paper is to prove that if s > 1 and G is a graph of order n > 4s + 6 satisfyin...
AbstractFor a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G i...
AbstractWe give a degree sum condition for three independent vertices under which every matching of ...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
AbstractA cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident w...
Let $G_{k,n}$ be the $n$-balanced $k$-partite graph, whose vertex set can be partitioned into $k$ pa...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
For an integer k \u3e 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-...
For a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G is comple...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
The aim of this paper is to prove that if s > 1 and G is a graph of order n > 4s + 6 satisfyin...
AbstractFor a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G i...
AbstractWe give a degree sum condition for three independent vertices under which every matching of ...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
AbstractA cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident w...
Let $G_{k,n}$ be the $n$-balanced $k$-partite graph, whose vertex set can be partitioned into $k$ pa...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
AbstractLet G be a simple k-connected graph of order ν ≥ 3 with minimum degree δ and independence nu...
For an integer k \u3e 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-...
For a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G is comple...
DOI
Add to ORKG