AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent vertices, the degree sum is at least 2n − 1, is pancyclic with some exceptions
AbstractAn in-tournament is an oriented graph, where the negative neighborhood of every vertex induc...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent verti...
AbstractA graph G of order n is said to be in the class O(n − 1) if deg(u) + deg(ʋ) ⩾ n − 1 for ever...
AbstractWe prove the theorem: Let G = (X, U) be an oriented strongly connected graph with n(≥2) vert...
AbstractAn in-tournament is a loopless digraph without multiple arcs and cycles of length 2 such tha...
AbstractLet G be a graph of order n and S a subset of V(G). We define G to be S-pancyclable if for e...
AbstractAn arc going out from a vertex x in a digraph is called an out-arc of x. Yao et al. [Discret...
AbstractWe use a recent cycle structure theorem to prove that three well-known hamiltonian degree co...
AbstractA digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pa...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractAn in-tournament is an oriented graph, where the negative neighborhood of every vertex induc...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent verti...
AbstractA graph G of order n is said to be in the class O(n − 1) if deg(u) + deg(ʋ) ⩾ n − 1 for ever...
AbstractWe prove the theorem: Let G = (X, U) be an oriented strongly connected graph with n(≥2) vert...
AbstractAn in-tournament is a loopless digraph without multiple arcs and cycles of length 2 such tha...
AbstractLet G be a graph of order n and S a subset of V(G). We define G to be S-pancyclable if for e...
AbstractAn arc going out from a vertex x in a digraph is called an out-arc of x. Yao et al. [Discret...
AbstractWe use a recent cycle structure theorem to prove that three well-known hamiltonian degree co...
AbstractA digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pa...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractAn in-tournament is an oriented graph, where the negative neighborhood of every vertex induc...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
DOI
Add to ORKG