Results 51 to 60 of about 782 (111)
Discussiones Mathematicae Graph Theory, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bi Zhenming, Zhang Ping
openaire +3 more sources
Journal of Combinatorial Theory, Series B, 1976 AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancyclic unless it is one of the graphs Kp,p. This generalizes a result of A. Ghouila-Houri. We disprove a conjecture of J. A. Bondy by showing that there exist hamiltonian digraphs with n vertices and 12n(n + 1) – 3 edges which are not pancyclic.
Häggkvist, Roland, Thomassen, Carsten
openaire +2 more sources
Chorded k-pancyclic and weakly k-pancyclic graphs
Discussiones Mathematicae Graph TheorySummary: As natural relaxations of pancyclic graphs, we say a graph \(G\) is \(k\)-pancyclic if \(G\) contains cycles of each length from \(k\) to \(|V(G)|\) and \(G\) is weakly pancyclic if it contains cycles of all lengths from the girth to the circumference of \(G\), while \(G\) is weakly \(k\)-pancyclic if it contains cycles of all lengths from \(k\
Megan Cream, Ronald J. Gould
openaire +3 more sources
Pancyclicity of hamiltonian line graphs
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Blanken, E. +2 more
openaire +1 more source
On the pancyclicity of 1-tough graphs [PDF]
Discrete Mathematics Letters, 2020 Rao Li
doaj +1 more source
Discrete Mathematics, 2001 Suppose \(k\) and \(n\) are integers such that \(3\leq k\leq n\). If \(3\leq k\leq\sqrt{n+1}\), let \(h(k)= (n+ 1)/k+ (k- 4)/2\) if \(k\) is even and let \(h(k)= (n+ 2)/k+ (k-5)/2\) if \(k\) is odd. If \(\sqrt{n+1}< k\leq n\), let \(h(k)= 3n/(2k+ 2)- 1/2\).
openaire +2 more sources
Cycle-pancyclism in bipartite tournaments I
Discussiones Mathematicae Graph Theory, 2004 Summary: Let \(T\) be a Hamiltonian bipartite tournament with \(n\) vertices, \(\gamma\) a Hamiltonian directed cycle of \(T\), and \(k\) an even number. In this paper, the following question is studied: What is the maximum intersection with \(\gamma\) of a directed cycle of length \(k\) contained in \(T[V(\gamma)]\)? It is proved that for an even \(k\)
openaire +3 more sources
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goddard, Wayne, Henning, Michael A.
openaire +1 more source