Results 11 to 20 of about 1,777 (160)
A generalization of Bondy's pancyclicity theorem [PDF]
Combinatorics, Probability and Computing, 2023 The \emph{bipartite independence number} of a graph $G$, denoted as $\tilde\alpha(G)$, is the minimal number $k$ such that there exist positive integers $a$ and $b$ with $a+b=k+1$ with the property that for any two sets $A,B\subseteq V(G)$ with $A=a$ and
Nemanja Dragani'c +2 more
semanticscholar +4 more sources
Pancyclicity of Hamiltonian line graphs [PDF]
Discrete Mathematics, 1995 Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n), the line graph L(G) of G is pancyclic whenever L(G) is hamiltonian. Results are proved showing that f(n) = ®(n 1/3)
van Blanken, E. +3 more
core +9 more sources
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs [PDF]
Discrete Mathematics, 1995 AbstractA digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite graph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with both end vertices in X ∪ Y coincides with X × Y = {(x, y ...
Gregory Gutin
openalex +6 more sources
Graphs which have pancyclic complements [PDF]
International Journal of Mathematics and Mathematical Sciences, Volume 1, Issue 2, Page 177-185, 1978., 1978 Let p and q denote the number of vertices and edges of a graph G, respectively. Let Δ(G) denote the maximum degree of G, and G¯ the complement of G. A graph G of order p is said to be pancyclic if G contains a cycle of each length n, 3 ≤ n ≤ p. For a nonnegative integer k, a connected graph G is said to be of rank k if q = p − 1 + k.
H. Joseph Straight
openalex +2 more sources
Discrete Mathematics, 2001 AbstractAn in-tournament is an oriented graph, where the negative neighborhood of every vertex induces a tournament. In this paper, the influence of the minimum indegree δ−(D) of an in-tournament D on its k-pancyclicity is considered. An oriented graph of order n is said to be k-pancyclic for some 3⩽k⩽n, if it contains an oriented cycle of length t for
Meike Tewes
openalex +3 more sources
On pancyclic line graphs [PDF]
Czechoslovak Mathematical Journal, 1978 Ladislav Nebeský
openalex +3 more sources
On the stability for pancyclicity
Discussiones Mathematicae Graph Theory, 2001 Ingo Schiermeyer
openalex +4 more sources
Journal of Combinatorial Theory, Series B, 1999 AbstractA graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference. A substantial result of Häggkvist, Faudree, and Schelp (1981) states that a Hamiltonian non-bipartite graph of order n and size at least ⌊(n−1)2/4⌋+2 contains cycles of every length l, 3⩽l⩽n.
Béla Bollobás, Andrew Thomason
openalex +3 more sources
Strongly pancyclic and dual-pancyclic graphs [PDF]
Discussiones Mathematicae Graph Theory, 2009 Terry A. McKee
openalex +3 more sources
Arc-pancyclicity of hypertournaments with irregularity at most two
Discrete Mathematics, 2022 Lan Xiao
openalex +2 more sources