Results 71 to 80 of about 878 (132)
Edge-pancyclicity of coupled graphs
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lih, Ko-Wei +3 more
openaire +2 more sources
Edge-pancyclic block-intersection graphs
Discrete Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alspach, Brian, Hare, Donovan
openaire +2 more sources
Global cycle properties in graphs with large minimum clustering coefficient
, 2016 The clustering coefficient of a vertex in a graph is the proportion of neighbours of the vertex that are adjacent. The minimum clustering coefficient of a graph is the smallest clustering coefficient taken over all vertices.
Borchert, Adam +2 more
core
Pancyclicity in claw-free graphs
Discrete Mathematics, 2002 A graph \(G\) is subpancyclic if it contains cycles of every length \(m\) with \(3\leq m\leq c(G)\), where \(c(G)\) denotes the circumference of \(G\). The authors present several conditions for claw-free graphs, which guarantee the graphs are subpancyclic.
Gould, R.J., Pfender, F.
openaire +1 more source
Hamiltonicity, Pancyclicity, and Cycle Extendability in Graphs
, 2021 Deborah C. Arangno
openalex +2 more sources
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs [PDF]
, 2022 Peixue Zhao, Fei Huang
openalex +1 more source
Pancyclic BIBD block-intersection graphs
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mamut, Aygul +2 more
openaire +2 more sources
$(r)$-Pancyclic, $(r)$-Bipancyclic and Oddly $(r)$-Bipancyclic Graphs [PDF]
, 2015 Abdollah Khodkar +3 more
openalex +1 more source
Embedding large subgraphs into dense graphs
, 2009 What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by
Kühn, Daniela, Osthus, Deryk
core +1 more source
Pancyclism and Bipancyclism of Hamiltonian Graphs
Journal of Combinatorial Theory, Series B, 1994 The following statements are well known: (1) [\textit{J. A. Bondy}, J. Comb. Theory, Ser. B 11, 80-84 (1971; Zbl 0183.523)]: Let \(G\) be a graph on \(n \geq 3\) vertices satisfying the condition \((*)\): \((x,y) \notin E(G)\) implies that \(d(x)=d(y) \geq n\) for \(x,y \in V(G)\). Then \(G\) is either pancyclic or the complete bipartite graph \(K_{n/2,
openaire +1 more source