A solution to the forest leave problem for partial 6-cycle systems

D. J. Ashe*, Hung-Lin Fu, C. A. Rodger

*Corresponding author for this work

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

Conditions for the existence of a 6-cycle system of Kn-E(F) for any spanning forest F of Kn were discussed. Here, F is a leave and a forest is defined as the graph that contains no cycle. It was shown that when the leave is a forest, it must be that n is even. Results obtaining m-cycle systems of graphs that are close to complete, were obtained when m is odd, with each vertex having even degree in the leave.

Original languageEnglish
Pages (from-to)27-41
Number of pages15
JournalDiscrete Mathematics
Volume281
Issue number1-3
DOIs
StatePublished - 28 Apr 2004

Keywords

  • 6-cycle
  • Cycle systems
  • Forest
  • Leave

Fingerprint Dive into the research topics of 'A solution to the forest leave problem for partial 6-cycle systems'. Together they form a unique fingerprint.

  • Cite this