Results 71 to 80 of about 105 (94)
A SUFFICIENT CONDITION FOR PANCYCLIC GRAPHS
Abstract A graph G is called an $[s,t]$ -graph if any induced subgraph of G of
openaire +2 more sources
On the optimal layout of (K<sub>p</sub> - C<sub>p</sub>)<sup>n</sup> into grid and certain structures. [PDF]
Vincy GC, Micheal DR.
europepmc +1 more source
Characterizing Mechanisms of Ischemia in Patients With Myocardial Bridges. [PDF]
Sinha A +14 more
europepmc +1 more source
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
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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Ken S. +3 more
openaire +2 more sources
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsu, Hong-Chun +2 more
openaire +1 more source
Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Lili +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Lili +4 more
openaire +2 more sources

