Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5428703> ?p ?o }
Showing triples 1 to 44 of
44
with 100 triples per page.
- Q5428703 subject Q7012142.
- Q5428703 subject Q7217193.
- Q5428703 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.".
- Q5428703 thumbnail Factor_critical.svg?width=300.
- Q5428703 wikiPageWikiLink Q1030529.
- Q5428703 wikiPageWikiLink Q1065144.
- Q5428703 wikiPageWikiLink Q131476.
- Q5428703 wikiPageWikiLink Q1397646.
- Q5428703 wikiPageWikiLink Q139829.
- Q5428703 wikiPageWikiLink Q141488.
- Q5428703 wikiPageWikiLink Q1415372.
- Q5428703 wikiPageWikiLink Q1475294.
- Q5428703 wikiPageWikiLink Q166507.
- Q5428703 wikiPageWikiLink Q174733.
- Q5428703 wikiPageWikiLink Q188758.
- Q5428703 wikiPageWikiLink Q230655.
- Q5428703 wikiPageWikiLink Q2393193.
- Q5428703 wikiPageWikiLink Q245595.
- Q5428703 wikiPageWikiLink Q2532492.
- Q5428703 wikiPageWikiLink Q273037.
- Q5428703 wikiPageWikiLink Q3034655.
- Q5428703 wikiPageWikiLink Q3115494.
- Q5428703 wikiPageWikiLink Q3115621.
- Q5428703 wikiPageWikiLink Q357918.
- Q5428703 wikiPageWikiLink Q45715.
- Q5428703 wikiPageWikiLink Q504353.
- Q5428703 wikiPageWikiLink Q504843.
- Q5428703 wikiPageWikiLink Q5129750.
- Q5428703 wikiPageWikiLink Q5186721.
- Q5428703 wikiPageWikiLink Q5325632.
- Q5428703 wikiPageWikiLink Q5504427.
- Q5428703 wikiPageWikiLink Q622506.
- Q5428703 wikiPageWikiLink Q7012142.
- Q5428703 wikiPageWikiLink Q7217193.
- Q5428703 wikiPageWikiLink Q826467.
- Q5428703 wikiPageWikiLink Q833449.
- Q5428703 wikiPageWikiLink Q8348314.
- Q5428703 wikiPageWikiLink Q898572.
- Q5428703 wikiPageWikiLink Q902252.
- Q5428703 wikiPageWikiLink Q92866.
- Q5428703 wikiPageWikiLink Q977674.
- Q5428703 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.".
- Q5428703 label "Factor-critical graph".
- Q5428703 depiction Factor_critical.svg.