In the mathematical study of graph theory, a pancyclic graph is a directed graph or undirected graph that contains cycles of all possible lengths from...

Cycle graph, a graph that has the structure of a single cycle Pancyclic graph, a graph that has cycles of all possible lengths Cycle detection (graph theory)...

Frucht graph is a pancyclic, Halin graph with chromatic number 3, chromatic index 3, radius 3, and diameter 4. Like every Halin graph, the Frucht graph is...

notation for Hamiltonian cubic graphs. Lovász conjecture that vertex-transitive graphs are Hamiltonian Pancyclic graph, graphs with cycles of all lengths...

Specifically, every graph satisfying the conditions of Ore's theorem is either a regular complete bipartite graph or is pancyclic (Bondy 1971). Bondy...

Hamiltonicity: it is node pancyclic, meaning that for every vertex v and every k in the range from three to the number of vertices in the graph, there is a length-k...

Halin graph remains almost pancyclic if a single edge is contracted, and every Halin graph without interior vertices of degree three is pancyclic. The...

theorem Bondy–Chvátal theorem Even circuit theorem Hypohamiltonian graph Pancyclic graph John Adrian Bondy at the Mathematics Genealogy Project Charbit,...

In graph theory, a tournament is a directed graph with exactly one edge between each two vertices, in one of the two possible directions. Equivalently...

MR 1743840. Bondy, J. A. (1971), "Pancyclic graphs", Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory and Computing (Louisiana...

must either be the complete bipartite graph K n / 2 , n / 2 {\displaystyle K_{n/2,n/2}} or it must be pancyclic: not only does it contain a triangle,...

Berlekamp switching game Salem–Spencer set Secretary problem Tournament (graph theory) Erdős distinct distances problem Leo Moser at the Mathematics Genealogy...

cycle graph should always contain a Hamiltonian cycle, and this is now known to be true. More generally, although these graphs are not pancyclic, they...

In graph theory, a discipline within mathematics, the frequency partition of a graph (simple graph) is a partition of its vertices grouped by their degree...

graph. The concept of panconnectivity was introduced in 1975 by Yousef Alavi and James E. Williamson. Panconnected graphs are necessarily pancyclic:...

Ralph J.; Gould, Ronald J.; Jacobson, Michael S. (28 March 2009). "Pancyclic graphs and linear forests". Discrete Mathematics. 309 (5). Elsevier B.V.:...

Aberdeen, 1975). Congr. Numer. 15 (1976) 355–359. (with J. A. Bondy) ‘Pancyclic graphs II’. J. Combin. Theory Ser. B 20 (1976) 41–46. ‘Transversal matroids...

mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing...