TwoColoring
TwoColoring[g]
finds a two-coloring of graph 
if 
is bipartite. It returns a list of the labels 1 and 2 corresponding to the vertices.
Combinatorica`
Combinatorica`
TwoColoring
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
TwoColoring[g]
finds a two-coloring of graph 
if 
is bipartite. It returns a list of the labels 1 and 2 corresponding to the vertices.
更多信息和选项
- To use TwoColoring, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- The labeling is a valid coloring if and only if the graph is bipartite.
Wolfram Research (2012)，TwoColoring，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/TwoColoring.html.
文本
Wolfram Research (2012)，TwoColoring，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/TwoColoring.html.
CMS
Wolfram 语言. 2012. "TwoColoring." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TwoColoring.html.
APA
Wolfram 语言. (2012). TwoColoring. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/TwoColoring.html 年