AbstractLet G be a graph of order n and S a subset of V(G). We define G to be S-pancyclable if for every integer l,3⩽l⩽|S|, there exists a cycle in G that contains exactly l vertices of S. We prove that if the degree sum in G of every pair of nonadjacent vertices of S is at least n, then G is either S-pancyclable or else n is even, S=V(G) and G=Kn/2,n/2, or |S|=4, G[S]=K2,2 and the structure of G is well characterized
Abstract A graph G is vertex pancyclic if for each vertex v ∈ V (G), and for each integer k with 3 ≤...
For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of...
AbstractA graph G is said to be cyclable if for each orientation D of G, there exists a set S(D) ⊆V(...
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...
AbstractLet G be a graph and S a subset of V(G). Let α(S) denote the maximum number of pairwise nona...
AbstractLet G be a graph of order n and S be a vertex set of q vertices. We call G,S-pancyclable, if...
International audienceLet $G$ be a graph of order $n$ and $S$ be a set of $s$ vertices. We call $G$,...
AbstractLet G be a 2-connected bipartite balanced graph of order 2n and bipartition (X,Y). Let S be ...
AbstractLet G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length ...
AbstractA set S⊆V(G) is cyclable in G if G contains a cycle C with S⊆V(C), and pancyclable in G if G...
A property P defined on all graphs of order n is said to be k-stable if for any graph of order n tha...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
. Schmeichel and Hakimi [?], and Bauer and Schmeichel [?] gave an evidence in support of the well-kn...
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent verti...
Abstract A graph G is vertex pancyclic if for each vertex v ∈ V (G), and for each integer k with 3 ≤...
For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of...
AbstractA graph G is said to be cyclable if for each orientation D of G, there exists a set S(D) ⊆V(...
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...
AbstractLet G be a graph and S a subset of V(G). Let α(S) denote the maximum number of pairwise nona...
AbstractLet G be a graph of order n and S be a vertex set of q vertices. We call G,S-pancyclable, if...
International audienceLet $G$ be a graph of order $n$ and $S$ be a set of $s$ vertices. We call $G$,...
AbstractLet G be a 2-connected bipartite balanced graph of order 2n and bipartition (X,Y). Let S be ...
AbstractLet G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length ...
AbstractA set S⊆V(G) is cyclable in G if G contains a cycle C with S⊆V(C), and pancyclable in G if G...
A property P defined on all graphs of order n is said to be k-stable if for any graph of order n tha...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
. Schmeichel and Hakimi [?], and Bauer and Schmeichel [?] gave an evidence in support of the well-kn...
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent verti...
Abstract A graph G is vertex pancyclic if for each vertex v ∈ V (G), and for each integer k with 3 ≤...
For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of...
AbstractA graph G is said to be cyclable if for each orientation D of G, there exists a set S(D) ⊆V(...
DOI
Add to ORKG