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.

更多信息和选项

范例

基本范例  (2)

EulerianQ has been superseded by EulerianGraphQ:

Wolfram Research (2012),EulerianQ,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/EulerianQ.html.

文本

Wolfram Research (2012),EulerianQ,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/EulerianQ.html.

CMS

Wolfram 语言. 2012. "EulerianQ." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/EulerianQ.html.

APA

Wolfram 语言. (2012). EulerianQ. Wolfram 语言与系统参考资料中心. 追溯自 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 ]}