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.


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.
Details and Options
- 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.
See Also
Tech Notes
Related Guides
-
▪
- Graph Properties ▪
- Graphs & Networks ▪
- Graph Visualization ▪
- Computation on Graphs ▪
- Graph Construction & Representation ▪
- Graphs and Matrices ▪
- Graph Properties & Measurements ▪
- Graph Operations and Modifications ▪
- Statistical Analysis ▪
- Social Network Analysis ▪
- Graph Properties ▪
- Mathematical Data Formats ▪
- Discrete Mathematics
Text
Wolfram Research (2012), TwoColoring, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/TwoColoring.html.
CMS
Wolfram Language. 2012. "TwoColoring." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TwoColoring.html.
APA
Wolfram Language. (2012). TwoColoring. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/TwoColoring.html
BibTeX
@misc{reference.wolfram_2025_twocoloring, author="Wolfram Research", title="{TwoColoring}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/TwoColoring.html}", note=[Accessed: 14-August-2025]}
BibLaTeX
@online{reference.wolfram_2025_twocoloring, organization={Wolfram Research}, title={TwoColoring}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/TwoColoring.html}, note=[Accessed: 14-August-2025]}