(r)-pancyclic, (r)-bipancyclic and oddly (r)-bipancyclic graphs

MaRDI QIDQ4590896zbMATH OpenFDO

Authors Oliver Sawin, Lisa Mueller, Wonhyuk Choi, Abdollah Khodkar

Publication date 20 November 2017

Full work available at URL https://arxiv.org/abs/1510.03052

Mathematics Subject Classification ID

Paths and cycles (05C38)

Abstract: A graph with $v$ vertices is $(r)$-pancyclic if it contains precisely $r$ cycles of every length from 3 to $v$. A bipartite graph with even number of vertices $v$ is said to be $(r)$-bipancyclic if it contains precisely $r$ cycles of each even length from 4 to $v$. A bipartite graph with odd number of vertices $v$ and minimum degree at least 2 is said to be oddly $(r)$-bipancyclic if it contains precisely $r$ cycles of each even length from 4 to $v-1$. In this paper, using computer search, we classify all $(r)$-pancyclic and $(r)$-bipancyclic graphs with $v$ vertices and at most $v+5$ edges. We also classify all oddly $(r)$-bipancyclic graphs with $v$ vertices and at most $v+4$ edges.

Recommendations

• On \(r\)-\((k)\)-pancyclic graphs.
• Pancyclicity, panconnectivity, and panpositionability for general graphs and bipartite graphs.
• Pancyclic and Bipancyclic Graphs
• scientific article; zbMATH DE number 2148764
• Small bipancyclic graphs

Cited in

(3)

• On \(r\)-\((k)\)-pancyclic graphs.
• (2)-pancyclic graphs
• Small bipancyclic graphs

This page was built for publication: \((r)\)-pancyclic, \((r)\)-bipancyclic and oddly \((r)\)-bipancyclic graphs

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