Results 61 to 70 of about 782 (111)

Pancyclism in hamiltonian graphs

Discrete Mathematics, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amar, D., Flandrin, E., Fournier, I., Germa, A.   +3 more
openaire   +1 more source

Arc-pancyclicity of hypertournaments with irregularity at most two

Discrete Mathematics, 2023
Lan Xiao
semanticscholar   +1 more source

Strongly pancyclic and dual-pancyclic graphs

Discussiones Mathematicae Graph Theory, 2009
openaire   +1 more source

A SUFFICIENT CONDITION FOR PANCYCLIC GRAPHS

Bulletin of the Australian Mathematical Society
Abstract A graph G is called an $[s,t]$ -graph if any induced subgraph of G of
openaire   +2 more sources

Pancyclic Cayley Graphs

, 2012
2010 Mathematics Subject Classification: Primary 05C25. Secondary 20K01, 05C45. Let Cay(G;S) denote the Cayley graph on a finite group G with connection set S. We extend two results about the existence of cycles in Cay(G;S) from cyclic groups to arbitrary finite Abelian groups when S is a “natural” set of generators for G.
openaire   +1 more source

Berge Pancyclic hypergraphs

A Berge cycle of length $\ell$ in a hypergraph is an alternating sequence of $\ell$ distinct vertices and $\ell$ distinct edges $v_1,e_1,v_2, \ldots, v_\ell, e_{\ell}$ such that $\{v_i, v_{i+1}\} \subseteq e_i$ for all $i$, with indices taken modulo $\ell$.
Bailey, Teegan, Li, Yupei, Luo, Ruth
openaire   +1 more source

Hamiltonian pancyclic graphs

Discrete Mathematics, 1983
Amar, Denise, Flandrin, Evelyne, Fournier, Irène, Germa, Anne   +3 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Node-pancyclicity and edge-pancyclicity of hypercube variants

Information Processing Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Ken S., Yeoh, Shyun-Shyun, Chen, Chiuyuan, Hsu, Lih-Hsing   +3 more
openaire   +2 more sources

Geodesic pancyclicity and balanced pancyclicity of Augmented cubes

Information Processing Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsu, Hong-Chun, Lai, Pao-Lien, Tsai, Chang-Hsiung   +2 more
openaire   +1 more source

Spectral conditions of pancyclicity for t-tough graphs

Discrete Applied Mathematics
More than 40 years ago Chv\'atal introduced a new graph invariant, which he called graph toughness. From then on a lot of research has been conducted, mainly related to the relationship between toughness conditions and the existence of cyclic structures,
V. I. Benediktovich
semanticscholar   +2 more sources