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
A graph G with the double domination number γ×2(G) = k is said to be k- γ×2-critical if γ×2 (G + uv)...
In [2], Brousek characterizes all triples of connected graphs, G1, G2, G3, with Gi = K1,3 for some i...
In this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Ham...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractFor a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G i...
For a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G is comple...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
AbstractWe give sufficient Ore-type conditions for a balanced bipartite graph to contain every match...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
A graph is hamiltonian-connected if every pair of vertices can be connected by a hamiltonian path, a...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
A graph $G$ is $k$-edge-Hamiltonian if any collection of vertex-disjoint paths with at most $k$ edge...
AbstractA graph G is said to be n-factor-critical if G−S has a 1-factor for any S⊂V(G) with |S|=n. I...
AbstractIt is known that if G is a connected simple graph, then G3 is Hamiltonian (in fact, Hamilton...
A graph G with the double domination number γ×2(G) = k is said to be k- γ×2-critical if γ×2 (G + uv)...
In [2], Brousek characterizes all triples of connected graphs, G1, G2, G3, with Gi = K1,3 for some i...
In this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Ham...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractFor a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G i...
For a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G is comple...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
AbstractWe give sufficient Ore-type conditions for a balanced bipartite graph to contain every match...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
A graph is hamiltonian-connected if every pair of vertices can be connected by a hamiltonian path, a...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
A graph $G$ is $k$-edge-Hamiltonian if any collection of vertex-disjoint paths with at most $k$ edge...
AbstractA graph G is said to be n-factor-critical if G−S has a 1-factor for any S⊂V(G) with |S|=n. I...
AbstractIt is known that if G is a connected simple graph, then G3 is Hamiltonian (in fact, Hamilton...
A graph G with the double domination number γ×2(G) = k is said to be k- γ×2-critical if γ×2 (G + uv)...
In [2], Brousek characterizes all triples of connected graphs, G1, G2, G3, with Gi = K1,3 for some i...
In this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Ham...
DOI
Add to ORKG