Decomposition into cycles I: Hamilton decompositions

Brian Alspach; Jean-Claude Bermond; Dominique Sotteau

Conference papers

Decomposition into cycles I: Hamilton decompositions

Brian Alspach ¹ Jean-Claude Bermond ² Dominique Sotteau ²

2 LRI - Laboratoire de Recherche en Informatique

Abstract : In this part we survey the results concerning the partitions of the edge-set of a graph into Hamilton cycles or into Hamilton cycles and a single perfect matching.

Document type :

Conference papers

Domain :

Computer Science [cs] / Discrete Mathematics [cs.DM]

Computer Science [cs] / Data Structures and Algorithms [cs.DS]

Computer Science [cs] / Networking and Internet Architecture [cs.NI]

Computer Science [cs] / Operations Research [cs.RO]

Computer Science [cs] / Social and Information Networks [cs.SI]

Complete list of metadata

https://hal.inria.fr/hal-03013446
Contributor : Jean-Claude Bermond Connect in order to contact the contributor
Submitted on : Wednesday, November 18, 2020 - 11:42:50 PM
Last modification on : Friday, July 9, 2021 - 4:43:51 AM
Long-term archiving on: : Friday, February 19, 2021 - 9:01:40 PM

Decomposition into cycles I: Hamilton decompositions

File

Identifiers

Collections

Citation

Export

Metrics

26

197

Contact Legal Notice Personal Data

Decomposition into cycles I: Hamilton decompositions

File

Identifiers

Collections

Citation

Export

Share

Metrics

26

197

Contact Legal Notice Personal Data