X

Decomposing graphs into cycles with chords

Supplemental material for the paper Decomposing graphs into cycles with chords by Paul Balister, Hao Li, and Richard Schelp, Journal of Combinatorial Theory, Series B 128 (2018), 47–65.

  • Self-contained C-code to check to low order cases in Lemmas 5, 9, 10, and 11. Just compile and run. (The last few cases in Lemma 11 are very slow though!) See code for documentation.
  • Output of program.

The University of Memphis uses cookies in order to enhance your website experience. Visit our Website’s Cookie Policy for more information on how the UofM uses cookies. I understand that by clicking “I agree” and/or continuing to use this website, I agree to the UofM’s use of cookies. More information >