{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etds-1547"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etds-1547","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"Enumeration of inequivalent cycle decompositions","abstract":"A k-cycle decomposition of order n is a partition of the edges of the complete graph on n vertices into k-cycles. In this report a backtracking algorithm is developed to count the number of inequivalent k-cycle decompositions of order n.","abstract_html":"A k-cycle decomposition of order n is a partition of the edges of the complete graph on n vertices into k-cycles. In this report a backtracking algorithm is developed to count the number of inequivalent k-cycle decompositions of order n.","abstract_has_math":false,"creators":["Laffin, William J."],"institution":null,"degree_name":"Master of Science in Mathematical Sciences (MS)","degree_level":"Master's report","degree_discipline":"Department of Mathematical Sciences","degree_department":null,"school":null,"contributors":["Donald L. Kreher"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:15:22Z","subjects":["Mathematics","Physical Sciences and Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etds/548"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etds/548","href":"https://digitalcommons.mtu.edu/etds/548","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etds/548","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etds/548","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.mtu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.mtu.edu%3Aetds-1547","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Donald L. Kreher"]},{"key":"dc:creator","label":"Author","values":["Laffin, William J."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2011-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Master's report"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Mathematical Sciences (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics","Physical Sciences and Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etds/548","https://digitalcommons.mtu.edu/etds/548"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A k-cycle decomposition of order n is a partition of the edges of the complete graph on n vertices into k-cycles. In this report a backtracking algorithm is developed to count the number of inequivalent k-cycle decompositions of order n."]},{"key":"dc:title","label":"Title","values":["Enumeration of inequivalent cycle decompositions"]}]}],"canonical_facts":{"dc:contributor":["Donald L. Kreher"],"dc:creator":["Laffin, William J."],"dc:date.created":["2011-01-01T08:00:00Z"],"dc:description.abstract":["A k-cycle decomposition of order n is a partition of the edges of the complete graph on n vertices into k-cycles. In this report a backtracking algorithm is developed to count the number of inequivalent k-cycle decompositions of order n."],"dc:identifier":["10.37099/mtu.dc.etds/548","https://digitalcommons.mtu.edu/etds/548"],"dc:subject":["Mathematics","Physical Sciences and Mathematics"],"dc:title":["Enumeration of inequivalent cycle decompositions"],"thesis:degree_discipline":["Department of Mathematical Sciences"],"thesis:degree_level":["Master's report"],"thesis:degree_name":["Master of Science in Mathematical Sciences (MS)"]},"updated_at":"2026-11-19T08:15:22Z"}