Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion

  • Authors:

  • Marcel Wild

  • Affiliations:

  • Department of Mathematical Sciences, University of Stellenbosch, Van der Ster Gebou, kamer 2023, 7602 Stellenbosch, South Africa

  • Venue:
  • Journal of Discrete Algorithms
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

An efficient method to generate all edge sets X@?E of a graph G=(V,E), which are vertex-disjoint unions of cycles, is presented. It can be tweaked to generate (i) all cycles, (ii) all cycles of cardinality =