Pancyclicity when each cycle contains \(k\) chords

DOI10.7151/dmgt.2106zbMath1415.05084arXiv1612.08802OpenAlexW2806172401MaRDI QIDQ2312065

Vladislav Taranchuk

Publication date: 4 July 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

chordspancyclicity

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Other combinatorial number theory (11B75) Distance in graphs (05C12)

Cites Work

• A note on the minimum size of a vertex pancyclic graph
• Pancyclicity when each cycle must pass exactly \(k\) Hamilton cycle chords
• Pancyclic graphs. I
• Pancyclic and Bipancyclic Graphs

This page was built for publication: Pancyclicity when each cycle contains \(k\) chords