Combinatorica`
Combinatorica`

EulerianQ

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

EulerianQ[g]

yields True if graph g is Eulerian, meaning there exists a tour that includes each edge exactly once.

Details and Options

Examples

Basic Examples  (2)

EulerianQ has been superseded by EulerianGraphQ:

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

Text

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

CMS

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

APA

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

BibTeX

@misc{reference.wolfram_2024_eulerianq, author="Wolfram Research", title="{EulerianQ}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/EulerianQ.html}", note=[Accessed: 18-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_eulerianq, organization={Wolfram Research}, title={EulerianQ}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/EulerianQ.html}, note=[Accessed: 18-November-2024 ]}