Results 91 to 100 of about 676 (119)
Some of the next articles are maybe not open access.
Pancyclicity of Strong Products of Graphs
Graphs and Combinatorics, 2004A graph with \(n\) vertices is pancyclic if it contains a cycle of length \(s\) for all \(s\), \(3\leq s\leq n\). In particular, a pancyclic graph is Hamiltonian. The {strong product} of \(k\) graphs \(G_1=(V_1,E_1),\dots, G_k=(V_k,E_k)\) is the graph \(G_1\times\cdots\times G_k\) with \(V_1\times\cdots \times V_k\) as set of vertices and two vertices \
Král, Daniel +3 more
openaire +2 more sources
Erratum to “Pancyclicity of recursive circulant graphs”
Information Processing Letters, 2002Correction of ibid. 81, 187--190 (2002; Zbl 1013.68137).
Araki, Tom, Shibata, Yukio
openaire +1 more source
Acta Mathematicae Applicatae Sinica, 1987
A graph with n vertices is pancyclic if it contains for every k, \(3\leq k\leq n,\) a circuit of length k. A graph is vertex pancyclic if every vertex is contained in a circuit of length k for every k, \(3\leq k\leq n\). In the paper are given some sufficient conditions for a graph which is a line graph of a finite graph G to be (vertex) pancyclic.
openaire +2 more sources
A graph with n vertices is pancyclic if it contains for every k, \(3\leq k\leq n,\) a circuit of length k. A graph is vertex pancyclic if every vertex is contained in a circuit of length k for every k, \(3\leq k\leq n\). In the paper are given some sufficient conditions for a graph which is a line graph of a finite graph G to be (vertex) pancyclic.
openaire +2 more sources
Pancyclicity of recursive circulant graphs
Information Processing Letters, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Araki, Toru, Shibata, Yukio
openaire +2 more sources
Pancyclicity of connected circulant graphs
Journal of Graph Theory, 1996The following results are shown for connected circulant graphs \(G\): (1) If \(G\) has at least two jumps, then every edge of \(G\) lies in a cycle of each even length \(i, i\geq 4\). (2) If the smallest cycle of \(G\) is a triangle, then \(G\) is pancyclic. To show these results, cycles of the specified lengths are all explicitly given.
openaire +2 more sources
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma
Ca-A Cancer Journal for Clinicians, 2020Aaron J Grossberg +2 more
exaly
Oral complications of cancer and cancer therapy
Ca-A Cancer Journal for Clinicians, 2012Joel B Epstein +2 more
exaly