Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Factor-critical_graph> ?p ?o }
Showing triples 1 to 67 of
67
with 100 triples per page.
- Factor-critical_graph abstract "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. So equivalently, a factor-critical graph is a graph in which there are near-perfect matchings that avoid every possible vertex.".
- Factor-critical_graph thumbnail Factor_critical.svg?width=300.
- Factor-critical_graph wikiPageID "7684634".
- Factor-critical_graph wikiPageLength "15384".
- Factor-critical_graph wikiPageOutDegree "48".
- Factor-critical_graph wikiPageRevisionID "702634183".
- Factor-critical_graph wikiPageWikiLink Bipartite_graph.
- Factor-critical_graph wikiPageWikiLink Blossom_algorithm.
- Factor-critical_graph wikiPageWikiLink Bridge_(graph_theory).
- Factor-critical_graph wikiPageWikiLink Category:Graph_families.
- Factor-critical_graph wikiPageWikiLink Category:Matching.
- Factor-critical_graph wikiPageWikiLink Claw-free_graph.
- Factor-critical_graph wikiPageWikiLink Complement_graph.
- Factor-critical_graph wikiPageWikiLink Complete_graph.
- Factor-critical_graph wikiPageWikiLink Connectivity_(graph_theory).
- Factor-critical_graph wikiPageWikiLink Critical_graph.
- Factor-critical_graph wikiPageWikiLink Cycle_(graph_theory).
- Factor-critical_graph wikiPageWikiLink Cycle_graph.
- Factor-critical_graph wikiPageWikiLink Ear_decomposition.
- Factor-critical_graph wikiPageWikiLink Edge_contraction.
- Factor-critical_graph wikiPageWikiLink Friendship_graph.
- Factor-critical_graph wikiPageWikiLink Glossary_of_graph_theory.
- Factor-critical_graph wikiPageWikiLink Graph_(discrete_mathematics).
- Factor-critical_graph wikiPageWikiLink Graph_coloring.
- Factor-critical_graph wikiPageWikiLink Graph_theory.
- Factor-critical_graph wikiPageWikiLink Greedy_algorithm.
- Factor-critical_graph wikiPageWikiLink Grötzsch_graph.
- Factor-critical_graph wikiPageWikiLink Gyroelongated_pentagonal_pyramid.
- Factor-critical_graph wikiPageWikiLink Hamiltonian_path.
- Factor-critical_graph wikiPageWikiLink Jack_Edmonds.
- Factor-critical_graph wikiPageWikiLink K-edge-connected_graph.
- Factor-critical_graph wikiPageWikiLink K-vertex-connected_graph.
- Factor-critical_graph wikiPageWikiLink László_Lovász.
- Factor-critical_graph wikiPageWikiLink Matching_(graph_theory).
- Factor-critical_graph wikiPageWikiLink Matching_polytope.
- Factor-critical_graph wikiPageWikiLink Matroid.
- Factor-critical_graph wikiPageWikiLink Maximal_element.
- Factor-critical_graph wikiPageWikiLink Mycielskian.
- Factor-critical_graph wikiPageWikiLink Path_(graph_theory).
- Factor-critical_graph wikiPageWikiLink Polyhedral_combinatorics.
- Factor-critical_graph wikiPageWikiLink Regular_graph.
- Factor-critical_graph wikiPageWikiLink Regular_icosahedron.
- Factor-critical_graph wikiPageWikiLink Tibor_Gallai.
- Factor-critical_graph wikiPageWikiLink Time_complexity.
- Factor-critical_graph wikiPageWikiLink File:Factor_critical.svg.
- Factor-critical_graph wikiPageWikiLink File:Friendship_graphs.svg.
- Factor-critical_graph wikiPageWikiLink File:Gyroelongated_pentagonal_pyramid.png.
- Factor-critical_graph wikiPageWikiLinkText "Factor-critical graph".
- Factor-critical_graph wikiPageWikiLinkText "factor-critical graph".
- Factor-critical_graph wikiPageWikiLinkText "factor-critical".
- Factor-critical_graph wikiPageUsesTemplate Template:Math.
- Factor-critical_graph wikiPageUsesTemplate Template:Mvar.
- Factor-critical_graph wikiPageUsesTemplate Template:Reflist.
- Factor-critical_graph subject Category:Graph_families.
- Factor-critical_graph subject Category:Matching.
- Factor-critical_graph hypernym Graph.
- Factor-critical_graph type Software.
- Factor-critical_graph type Graph.
- 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.".
- Factor-critical_graph label "Factor-critical graph".
- Factor-critical_graph sameAs Q5428703.
- Factor-critical_graph sameAs گراف_فاکتور_بحرانی.
- Factor-critical_graph sameAs m.0f2c83.
- Factor-critical_graph sameAs Q5428703.
- Factor-critical_graph wasDerivedFrom Factor-critical_graph?oldid=702634183.
- Factor-critical_graph depiction Factor_critical.svg.
- Factor-critical_graph isPrimaryTopicOf Factor-critical_graph.