When every k-cycle has at least f(k) chords

DOI10.1002/JGT.20547zbMATH Open1250.05063OpenAlexW2006785792MaRDI QIDQ3174243FDOQ3174243

Authors: Terry A. McKee 

Publication date: 12 October 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20547

Recommendations

• Pancyclicity when each cycle contains \(k\) chords
• Pancyclicity when each cycle must pass exactly \(k\) Hamilton cycle chords
• scientific article; zbMATH DE number 1409205
• scientific article; zbMATH DE number 3997848
• scientific article; zbMATH DE number 3904622
• A note on a conjecture about cycles with many incident chords
• Graphs in which every \(c\) edges that form a tree are chords of a common cycle
• A characterization of \(k\)-cycles
• Chorded pancyclicity in \(k\)-partite graphs
• The extremal question for cycles with chords

zbMATH Keywords

cyclechordcographchoral graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Complement reducible graphs
• A characterization of ptolemaic graphs
• Title not available (Why is that?)

Cited In (5)

• Dirac-type characterizations of graphs without long chordless cycles
• Characterizing and generalizing cycle completable graphs
• Requiring pairwise nonadjacent chords in cycles
• A note on sparseness conditions on chordless vertices of cycles
• Pancyclicity when each cycle must pass exactly \(k\) Hamilton cycle chords

This page was built for publication: When every k-cycle has at least f(k) chords

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