AbstractLet G=(X,Y) be a 2-connected balanced bipartite graph with |X|=|Y|=n. In this paper, we prove that if |N(x1)∪N(x2)|+|N(y1)∪N(y2)|⩾n+2 for any {x1,x2}⊆X and {y1,y2}⊆Y, then G is hamiltonian except when G is a special graph on 8 or on 12 vertices
AbstractDirac proved that if each vertex of a graph G of order n⩾3 has degree at least n/2, then the...
AbstractLet G be a balanced bipartite graph of order 2n and minimum degree δ(G)⩾3. If, for every bal...
AbstractLet G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of ord...
Let G be a balanced bipartite graph of order 2n and minimum de-gree δ(G) ≥ 3. If for every balanced...
Copyright c © 2013 Yusleidy Alcala ́ et al. This is an open access article distributed under the Cre...
Abstract. Let G = (X, Y) be a bipartite graph and define σ22(G) = min{d(x) + d(y) : xy /∈ E(G), x ∈...
We describe a new type of sufficient condition for a balanced bipartitedigraph to be hamiltonian. Le...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
AbstractLet G=(X,Y) be a bipartite graph and define σ22(G)=min{d(x)+d(y):xy∉E(G),x∈X,y∈Y}. Moon and ...
AbstractLet G be a graph, N(u) the neighborhood of u for each u∈V(G), and N(U)=⋃u∈UN(u) for each U⊆V...
AbstractLet G be a simple graph of order n with connectivity k⩾2, independence number α. We prove th...
AbstractIn this paper, we prove the following two theorems: (1) If G is a hamiltonian graph of order...
Given a 2-connected graph G on n vertices, let G* be its partially square graph, obtained by adding ...
AbstractWe investigate the relationship between the cardinality of the union of the neighborhoods of...
Let D denote a balanced bipartite digraph with 2n vertices and for each vertex x, d+(x) ≥ k, d−(x) ...
AbstractDirac proved that if each vertex of a graph G of order n⩾3 has degree at least n/2, then the...
AbstractLet G be a balanced bipartite graph of order 2n and minimum degree δ(G)⩾3. If, for every bal...
AbstractLet G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of ord...
Let G be a balanced bipartite graph of order 2n and minimum de-gree δ(G) ≥ 3. If for every balanced...
Copyright c © 2013 Yusleidy Alcala ́ et al. This is an open access article distributed under the Cre...
Abstract. Let G = (X, Y) be a bipartite graph and define σ22(G) = min{d(x) + d(y) : xy /∈ E(G), x ∈...
We describe a new type of sufficient condition for a balanced bipartitedigraph to be hamiltonian. Le...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
AbstractLet G=(X,Y) be a bipartite graph and define σ22(G)=min{d(x)+d(y):xy∉E(G),x∈X,y∈Y}. Moon and ...
AbstractLet G be a graph, N(u) the neighborhood of u for each u∈V(G), and N(U)=⋃u∈UN(u) for each U⊆V...
AbstractLet G be a simple graph of order n with connectivity k⩾2, independence number α. We prove th...
AbstractIn this paper, we prove the following two theorems: (1) If G is a hamiltonian graph of order...
Given a 2-connected graph G on n vertices, let G* be its partially square graph, obtained by adding ...
AbstractWe investigate the relationship between the cardinality of the union of the neighborhoods of...
Let D denote a balanced bipartite digraph with 2n vertices and for each vertex x, d+(x) ≥ k, d−(x) ...
AbstractDirac proved that if each vertex of a graph G of order n⩾3 has degree at least n/2, then the...
AbstractLet G be a balanced bipartite graph of order 2n and minimum degree δ(G)⩾3. If, for every bal...
AbstractLet G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of ord...
DOI
Add to ORKG