Matches in DBpedia 2015-10 for { ?s ?p "In graph theory, a mathematical discipline, a factor-critical graph (or hypomatchable graph) is a graph with n vertices in which every subgraph of n − 1 vertices has a perfect matching. (A perfect matching in a graph is a subset of its edges with the property that each of its vertices is the endpoint of exactly one of the edges in the subset.)A matching that covers all but one vertex of a graph is called a near-perfect matching."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Factor-critical_graph comment "In graph theory, a mathematical discipline, a factor-critical graph (or hypomatchable graph) is a graph with n vertices in which every subgraph of n − 1 vertices has a perfect matching. (A perfect matching in a graph is a subset of its edges with the property that each of its vertices is the endpoint of exactly one of the edges in the subset.)A matching that covers all but one vertex of a graph is called a near-perfect matching.".