Minimal pancyclic graphs

MaRDI QIDQ2866564zbMATH OpenFDO

Authors John C. George, Alison Marr, Walter D. Wallis

Publication date 13 December 2013

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

cyclepancyclic graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Review text

A graph with \(v\) vertices is said to be pancyclic if it contains cycles of every length from 3 to \(v\). This paper discusses the minimum number \(m(v)\) of edges in a pancyclic graph. For some values of \(v\), the \(m(v)\) is determined by improving known lower and upper bounds.

Recommendations

• A note on the minimum size of a vertex pancyclic graph
• A new cycle structure theorem for Hamiltonian graphs
• Vertex pancyclic graphs
• A new sufficient condition for pancyclic graphs
• A sufficient condition for pancyclic graphs

Cited in

(9)

• A note on the minimum size of a vertex pancyclic graph
• Estimations for the number of cycles in a graph
• Pancyclicity when each cycle must pass exactly \(k\) Hamilton cycle chords
• scientific article; zbMATH DE number 6692111 (Why is no real title available?)
• Minimally rigid periodic graphs
• scientific article; zbMATH DE number 3985265 (Why is no real title available?)
• Minimal configuration bicyclic graphs
• Uniquely Bipancyclic Graphs on Thirty-two Vertices
• On the Minimum Order of Extremal Graphs to have a Prescribed Girth

This page was built for publication: Minimal pancyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866564)