Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Perfect matching
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Matching that covers every vertex of the graph
Property
Value
dbo:
description
Matching, das jeden Knoten überdeckt
(de)
matching that covers every vertex of the graph
(en)
全ての頂点が、マッチング中のいずれかの枝の端点になっているマッチング
(ja)
התאמה המכסה כל קודקוד של הגרף
(iw)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Maximum-matching-labels.svg?width=300
dbo:
wikiPageWikiLink
dbr
:Hall's_marriage_theorem
dbr
:Hall-type_theorems_for_hypergraphs
dbr
:Permanent_(mathematics)
dbr
:Edge_cover
dbr
:Matching_(graph_theory)
dbr
:Imaginary_number
dbr
:Odd_number
dbr
:FKT_algorithm
dbr
:Factor-critical_graph
dbr
:Graph_factorization
dbr
:♯P-complete
dbr
:Vertex_(graph_theory)
dbr
:Pieter_Kasteleyn
dbr
:Graph_theory
dbr
:Bipartite_graph
dbr
:Subset
dbr
:Skew-symmetric_matrix
dbr
:Double_factorial
dbr
:Complete_graph
dbc
:Matching_(graph_theory)
dbr
:Tutte_theorem
dbr
:Eigenvalues
dbr
:Graph_(discrete_mathematics)
dbr
:Planar_graph
dbr
:Regular_graph
dbr
:Perfect_matching_in_high-degree_hypergraphs
dbr
:Maximum_cardinality_matching
dbr
:Factor_(graph_theory)
dbr
:Envy-free_matching
dbr
:1-factor
dbr
:Biadjacency_matrix
dbr
:Polynomial-time
dbr
:File:Maximum-matching-labels.svg
dbp:
wikiPageUsesTemplate
dbt
:Main
dbt
:Math
dbt
:Mvar
dbt
:Abs
dbt
:Short_description
dct:
subject
dbc
:Matching_(graph_theory)
rdfs:
label
Perfect matching
(en)
owl:
sameAs
wikidata
:Perfect matching
dbpedia-global
:Perfect matching
prov:
wasDerivedFrom
wikipedia-en
:Perfect_matching?oldid=1274335307&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Maximum-matching-labels.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Perfect_matching
is
dbo:
wikiPageWikiLink
of
dbr
:Baranyai's_theorem
dbr
:Polyhedral_combinatorics
dbr
:Vertex_cycle_cover
dbr
:Glossary_of_graph_theory
dbr
:Hall-type_theorems_for_hypergraphs
dbr
:Permanent_(mathematics)
dbr
:Erdős–Ko–Rado_theorem
dbr
:Turán_graph
dbr
:Edge_cover
dbr
:Edge_coloring
dbr
:List_of_NP-complete_problems
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:Steiner_system
dbr
:Tesseract
dbr
:Factorial
dbr
:Parity_P
dbr
:Tutte_matrix
dbr
:Tutte–Berge_formula
dbr
:Exact_cover
dbr
:Christofides_algorithm
dbr
:Graceful_labeling
dbr
:Matching_(graph_theory)
dbr
:Claw-free_graph
dbr
:Bivariegated_graph
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:Ménage_problem
dbr
:Petersen's_theorem
dbr
:FKT_algorithm
dbr
:Factor-critical_graph
dbr
:Graph_factorization
dbr
:Cycle_decomposition_(graph_theory)
dbr
:Cycle_double_cover
dbr
:Hypercube_graph
dbr
:Petersen_graph
dbr
:♯P-complete
dbr
:Pfaffian
dbr
:Pfaffian_orientation
dbr
:Tensor_product_of_graphs
dbr
:Net_(polyhedron)
dbr
:Bipartite_graph
dbr
:Kleetope
dbr
:Automorphisms_of_the_symmetric_and_alternating_groups
dbr
:Edmonds_matrix
dbr
:Double_factorial
dbr
:15_(number)
dbr
:Complete_graph
dbr
:Complete_bipartite_graph
dbr
:Cubic_graph
dbr
:Strongly_connected_component
dbr
:Heawood_graph
dbr
:Crown_graph
dbr
:Outerplanar_graph
dbr
:Tietze's_graph
dbr
:Tutte–Coxeter_graph
dbr
:Inclusion–exclusion_principle
dbr
:Component_(graph_theory)
dbr
:Crispin_Nash-Williams
dbr
:Boxicity
dbr
:Brauer_algebra
dbr
:Apollonian_network
dbr
:Schwartz–Zippel_lemma
dbr
:Schönhardt_polyhedron
dbr
:Hungarian_algorithm
dbr
:Tutte_theorem
dbr
:Line_graph
dbr
:List_of_algorithms
dbr
:Fibonacci_cube
dbr
:LEMON_(C++_library)
dbr
:Blow-up_lemma
dbr
:Travelling_salesman_problem
dbr
:Circuit_rank
dbr
:Bipartite_double_cover
dbr
:Birkhoff_polytope
dbr
:Holographic_algorithm
dbr
:♯P-completeness_of_01-permanent
dbr
:Skew_partition
dbr
:Transversal_(combinatorics)
dbr
:Ear_decomposition
dbr
:Computing_the_permanent
dbr
:Continuous-time_quantum_walk
dbr
:Bregman–Minc_inequality
dbr
:Half_graph
dbr
:Oberwolfach_problem
dbr
:Daniel_Kráľ
dbr
:David_Sumner
dbr
:Matching_polytope
dbr
:Dulmage–Mendelsohn_decomposition
dbr
:Quartic_graph
dbr
:Combinatorial_Geometry_in_the_Plane
dbr
:Matching_in_hypergraphs
dbr
:Index_of_combinatorics_articles
dbr
:Hafnian
dbr
:Maximin_share
dbr
:The_Petersen_Graph
dbr
:Sachs_subgraph
dbr
:Well-covered_graph
dbr
:Michael_D._Plummer
dbr
:26-fullerene_graph
dbr
:PG(3,2)
dbr
:Maximum_cardinality_matching
dbr
:Folded_cube_graph
dbr
:William_R._Pulleyblank
dbr
:Odd_cycle_transversal
dbr
:Deficiency_(graph_theory)
dbr
:Birkhoff_algorithm
dbr
:Chord_diagram_(mathematics)
dbr
:Matching_preclusion
dbr
:Alspach's_conjecture
dbr
:Maximally-matchable_edge
is
foaf:
primaryTopic
of
wikipedia-en
:Perfect_matching
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International