Combinatorica`
Combinatorica`

ExtractCycles

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

ExtractCycles[g]

gives a maximal list of edge-disjoint cycles in graph g.

Details

Wolfram Research (2012), ExtractCycles, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/ExtractCycles.html.

Text

Wolfram Research (2012), ExtractCycles, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/ExtractCycles.html.

BibTeX

@misc{reference.wolfram_2021_extractcycles, author="Wolfram Research", title="{ExtractCycles}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/ExtractCycles.html}", note=[Accessed: 01-December-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_extractcycles, organization={Wolfram Research}, title={ExtractCycles}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/ExtractCycles.html}, note=[Accessed: 01-December-2021 ]}

CMS

Wolfram Language. 2012. "ExtractCycles." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/ExtractCycles.html.

APA

Wolfram Language. (2012). ExtractCycles. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/ExtractCycles.html