Results 71 to 80 of about 676 (119)
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
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
Sparse Pancyclic Subgraphs of Random Graphs
SIAM Journal on Discrete MathematicsIt is known that the complete graph $K_n$ contains a pancyclic subgraph with $n+(1+o(1))\cdot \log _2 n$ edges, and that there is no pancyclic graph on $n$ vertices with fewer than $n+\log _2 (n-1) -1$ edges. We show that, with high probability, $G(n,p)$ contains a pancyclic subgraph with $n+(1+o(1))\log_2 n$ edges for $p \ge p^*$, where $p^*=(1+o(1 ...
Alon, Yahav, Krivelevich, Michael
openaire +2 more sources
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
Pancyclic graphs and linear forests
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faudree, Ralph J. +2 more
openaire +2 more sources
A SUFFICIENT CONDITION FOR PANCYCLIC GRAPHS
Bulletin of the Australian Mathematical SocietyAbstract A graph G is called an $[s,t]$ -graph if any induced subgraph of G of
openaire +2 more sources
On pancyclism of hamiltonian graphs
Electronic Notes in Discrete Mathematics, 2000 Abstract Let n and Δ be two integers with Δ ≤ n − 1. We study the set of cycle lengths occurring in any hamiltonian graph G of order n and maximum degree Δ. We show that for the case n/2+1 ≤ Δ ≤ 2n-2/3 this set contains all the integers belonging to the union [3, 2Δ-n+2] ∪ [n-Δ+ 2,Δ+1], and for 2n−2 3 ≤ Δ ≤ n − 1 it contains every integer ...
openaire +1 more source
, 2012 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
Pancyclicity of almost-planar graphs
15 pages, 11 ...
Adams, Santiago T., Kingan, S. R.
openaire +2 more sources