Results 71 to 80 of about 635 (107)
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.
Chiuyuan Chen, Lih-Hsing Hsu
exaly +4 more sources
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianxi Fan, Xiaola Lin, Xiaohua Jia
exaly +3 more sources
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wayne Goddard, Michael A Henning
exaly +2 more sources
On the vertex-pancyclicity of hypertournaments
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Surmacs
exaly +5 more sources
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Chun Hsu +2 more
openaire +1 more source
Pancyclicity in switching classes
Information Processing Letters, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrzej Ehrenfeucht +3 more
openaire +2 more sources
On the Pancyclicity of Lexicographic Products
Graphs and Combinatorics, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomás Kaiser, Matthias Kriesell
openaire +2 more sources
Cycle-pancyclism in tournaments I
Graphs and Combinatorics, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hortensia Galeana-Sánchez +1 more
openaire +1 more source
Vertex‐pancyclicity of hypertournaments
Journal of Graph Theory, 2009AbstractA hypertournament or a k‐tournament, on n vertices, 2≤k≤n, is a pair T=(V, E), where the vertex set V is a set of size n and the edge set E is the collection of all possible subsets of size k of V, called the edges, each taken in one of its k! possible permutations.
openaire +3 more sources