Chords in longest cycles

Research output: Contribution to journalJournal articleResearchpeer-review

290 Downloads (Pure)

Abstract

If a graph G is 3-connected and has minimum degree at least 4, then some longest cycle in G has a chord. If G is 2-connected and cubic, then every longest cycle in G has a chord.
Original languageEnglish
JournalJournal of Combinatorial Theory. Series B
Volume129
Pages (from-to)148-157
ISSN0095-8956
DOIs
Publication statusPublished - 2017

Keywords

  • Chords
  • Connectivity
  • Longest cycles

Cite this