NoPerfectMatchingGraph
Combinatorica`
Combinatorica`
NoPerfectMatchingGraph
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
NoPerfectMatchingGraph
returns a connected graph with 16 vertices that contains no perfect matching.
Details and Options
- NoPerfectMatchingGraph functionality is now available in the built-in Wolfram Language function GraphData.
- To use NoPerfectMatchingGraph, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Examples
Basic Examples (2)
NoPerfectMatchingGraph has been superseded by GraphData:
Wolfram Research (2012), NoPerfectMatchingGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/NoPerfectMatchingGraph.html.
Text
Wolfram Research (2012), NoPerfectMatchingGraph, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/NoPerfectMatchingGraph.html.
CMS
Wolfram Language. 2012. "NoPerfectMatchingGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/NoPerfectMatchingGraph.html.
APA
Wolfram Language. (2012). NoPerfectMatchingGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/NoPerfectMatchingGraph.html