A hypergraph $\mathcal H$ is super-pancyclic if for each $A \subseteq V(\mathcal H)$ with $|A| \geqslant 3$, contains a Berge cycle base vertex set $A$. We present two natural necessary conditions to be super-pancyclic, and show that in several classes of hypergraphs these are also sufficient. In particular, they sufficient every $ \delta(\mathcal H)\geqslant \max\{|V(\mathcal H)|, \frac{|E(\ma...

In an edge-colored graph (G,c), let dc(v) denote the number of colors on edges incident with a vertex v G and δc(G) minimum value over all vertices v∈V(G). A cycle (G,c) is called proper if any two adjacent have distinct colors. An n≥3 properly vertex-pancyclic each contained in length ℓ for every 3≤ℓ≤n. Fujita Magnant conjectured that complete δc(G)≥n+12 vertex-pancyclic. Chen, Huang Yuan part...