Results 41 to 50 of about 303 (83)
Cycle spectra of contraction-critically 4-connected planar graphs
, 2021 Motivated by the long-standing and wide open pancyclicity conjectures of Bondy and Malkevitch, we study the cycle spectra of contraction-critically 4-connected planar graphs.
Lo, On-Hei Solomon, Schmidt, Jens M.
core +1 more source
On the pancyclicity of 1-tough graphs [PDF]
Discrete Mathematics Letters, 2020 Rao Li
doaj +1 more source
Arc pancyclicity in multipartite tournaments GTECS – an application in crystallography [PDF]
, 2014 This thesis consists of two parts where the first one represents theoretical results in the field of arc-pancyclicity and connectivity in multipartite tournaments and the second part presents the graph theoretical ideas and algorithms behind the ...
Grüter, Steffen
core
Hamiltonicity, Pancyclicity, and Cycle Extendability in Graphs [PDF]
, 2014 A significant portion of Graph Theory is devoted to determining the characteristics which guarantee the existence of long cycles. Long cycles have roles in applications to civil engineering, chemistry, and communications, among many others, but the ...
Arangno, Deborah C., Deborah C. Arangno
core +1 more source
, 2020 [[abstract]]A graph G = (V, E) is two-disjoint-cycle-cover [r1, r2]-pancyclic if for any integer l satisfying r1 ≤ l ≤ r2, there exist two vertex-disjoint cycles C1 and C2 in G such that the lengths of C1 and C2 are l and |V|− l, respectively, where |V ...
龔自良;KUNG, TZU-LIANG;Che, Hon-Chan;Chen, Hon-Chan;Lin, Chia-Hui;Lin, Chia-Hui;Hs, Lih-Hsing;Hsu, Lih-Hsing
core
On Berge Pancyclicity for Uniform Hypergraphs
An $n$-vertex graph $G$ is \textit{hamiltonian} if it contains a length $n$ cycle as a subgraph. A stronger notion of hamiltoncity is pancyclicity. A graph $G$ is \textit{pancyclic} if $G$ contains a cycle of length $k$ for every $3\leq k \leq n$.
Bailey, Teegan Cole
core +1 more source
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
, 2007 In this paper, we deal with the graph G0 ⊕G1 obtained from merging two graphs G0 and G1 with n vertices each by n pairwise nonadjacent edges joining vertices in G0 and vertices in G1.
Hyeong-seok Lim +2 more
core
Extremal and Degree Conditions for Path Extendability in Digraphs [PDF]
, 2017 In the study of cycles and paths, the meta-conjecture of Bondy that sufficient conditions for Hamiltonicity often imply pancyclicity has motivated research on the existence of cycles and paths of many lengths.
Zhang, Zan-Bo +7 more
core +1 more source
, 2009 [[abstract]]In this paper, we study the pancyclic properties of the WK-Recursive networks. We show that a WK-Recursive network with amplitude W and level L is vertex-pancyclic for W ≥ 6.
方覺非;馮士丞;黃玉潔
core
Geodesic pancyclicity and balanced pancyclicity of the generalized base-
, 2012 Recently, Chan et al. introduced geodesic-pancyclic graphs [H.C. Chan, J.M. Chang, Y.L. Wang, S.J. Horng, Geodesic-pancyclic graphs, Discrete Applied Mathematics 155 (15) (2007) 1971–1978] and weakly geodesic pancyclicity [H.C. Chan, J.M.
Chien-Hung Huang, Jywe-Fei Fang
core +1 more source