Results 51 to 60 of about 303 (83)
Sparse pancyclic subgraphs of random graphs
, 2023 It 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)$
Krivelevich, Michael, Alon, Yahav
core
Pancyclicity in strong k-quasi-transitive digraphs of large diameter
A digraph is k-quasi-transitive if the existence of a directed path of length k from vertex u to vertex v implies that u and v are adjacent; this family is a generalization of both tournaments and transitive digraphs.k-Quasi-transitive digraph; Quasi ...
Juárez-Camacho, Manuel Alejandro +1 more
core
Pancyclicity of almost-planar graphs
A non-planar graph is almost-planar if either deleting or contracting any edge makes it planar. A graph with $n$ vertices is pancyclic if it contains a cycle of every length from $3$ to $n$, and it is Hamiltonian if it contains a cycle of length $n$.
Adams, Santiago T., Kingan, S. R.
core
Paths, Trees and Cycles in Tournaments
, 2008 We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments.
Jørgen Bang-Jensen, Gregory Gutin
core
Cycles of given length in oriented graphs
, 2010 We show that for each ℓ⩾4 every sufficiently large oriented graph G with δ+(G),δ−(G)⩾⌊|G|/3⌋+1 contains an ℓ-cycle. This is best possible for all those ℓ⩾4 which are not divisible by 3.
Osthus, Deryk, Kelly, L, Kuhn, Daniela
core +1 more source
Cycling properties of circulant graphs
, 2022 Tato práce se věnuje cyklickým vlastnostem cirkulačních grafů. Především je zaměřena na pancyklicitu cirkulantů. Mějme dána kladná celá čísla 0 < a_1 < a_2 < ... < a_k
Rečková, Alena
core
A New Chvátal Type Condition For Pancyclicity
, 2007 . Schmeichel and Hakimi [?], and Bauer and Schmeichel [?] gave an evidence in support of the well-known Bondy's "metaconjecture" that almost any non-trivial condition on graphs which implies that the graph is hamiltonian also implies that ...
Ladislav Stacho
core
K-ordered graphs and out-arc pancyclicity on digraphs
, 2009 Over the years Hamiltonian graphs have been widely studied. Various Hamiltonian-related properties have also been considered. Some of the properties are weaker, for example traceability and existence of a cycle factor in graphs, while other are stronger,
Li, Ruijuan
core
Survey on path and cycle embedding in some networks [PDF]
, 2009 To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding problem. To find cycles of all lengths from its girth to its order in a graph is the pancyclic problem.
Jun-Ming Xu, Meijie Ma
core