HTML Microdata document

This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n4	http://dbpedia.org/resource/File:
n6	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
n15	http://commons.wikimedia.org/wiki/Special:FilePath/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Deficiency_(graph_theory)
dbo:wikiPageWikiLink: dbr:Gallai–Edmonds_decomposition

Subject Item: dbr:Dulmage–Mendelsohn_decomposition
dbo:wikiPageWikiLink: dbr:Gallai–Edmonds_decomposition

Subject Item: dbr:Gallai-Edmonds_decomposition
dbo:wikiPageWikiLink: dbr:Gallai–Edmonds_decomposition
dbo:wikiPageRedirects: dbr:Gallai–Edmonds_decomposition

Subject Item: dbr:Tibor_Gallai
dbo:wikiPageWikiLink: dbr:Gallai–Edmonds_decomposition

Subject Item: dbr:Gallai–Edmonds_decomposition
rdfs:label: Gallai–Edmonds decomposition
rdfs:comment: In graph theory, the Gallai–Edmonds decomposition is a partition of the vertices of a graph into three subsets which provides information on the structure of maximum matchings in the graph. Tibor Gallai and Jack Edmonds independently discovered it and proved its key properties. The Gallai–Edmonds decomposition of a graph can be found using the blossom algorithm.
foaf:depiction: n15:Gallai–Edmonds_decomposition.svg
dcterms:subject: dbc:Matching_(graph_theory) dbc:Graph_algorithms
dbo:wikiPageID: 59747277
dbo:wikiPageRevisionID: 1121742838
dbo:wikiPageWikiLink: dbr:Dulmage–Mendelsohn_decomposition n4:Gallai–Edmonds_decomposition.svg dbr:Graph_theory dbr:Jack_Edmonds dbr:Factor-critical_graph dbr:Maximum_matching dbr:Tibor_Gallai dbr:Induced_subgraph dbr:Blossom_algorithm dbc:Graph_algorithms dbc:Matching_(graph_theory) dbr:Union_(set_theory) dbr:Connected_component_(graph_theory) dbr:Disjoint_set dbr:Graph_(discrete_mathematics)
owl:sameAs: n6:ANRde wikidata:Q65117138
dbp:wikiPageUsesTemplate: dbt:Short_description dbt:Use_dmy_dates dbt:Reflist
dbo:thumbnail: n15:Gallai–Edmonds_decomposition.svg?width=300
dbo:abstract: In graph theory, the Gallai–Edmonds decomposition is a partition of the vertices of a graph into three subsets which provides information on the structure of maximum matchings in the graph. Tibor Gallai and Jack Edmonds independently discovered it and proved its key properties. The Gallai–Edmonds decomposition of a graph can be found using the blossom algorithm.
prov:wasDerivedFrom: wikipedia-en:Gallai–Edmonds_decomposition?oldid=1121742838&ns=0
dbo:wikiPageLength: 5223
foaf:isPrimaryTopicOf: wikipedia-en:Gallai–Edmonds_decomposition

Subject Item: dbr:Edmonds-Gallai_decomposition_theorem
dbo:wikiPageWikiLink: dbr:Gallai–Edmonds_decomposition
dbo:wikiPageRedirects: dbr:Gallai–Edmonds_decomposition

Subject Item: dbr:Jack_Edmonds
dbo:wikiPageWikiLink: dbr:Gallai–Edmonds_decomposition

Subject Item: dbr:Rank-maximal_allocation
dbo:wikiPageWikiLink: dbr:Gallai–Edmonds_decomposition

Subject Item: dbr:Edmonds-Gallai_decomposition
dbo:wikiPageWikiLink: dbr:Gallai–Edmonds_decomposition
dbo:wikiPageRedirects: dbr:Gallai–Edmonds_decomposition

Subject Item: dbr:Edmonds–Gallai_decomposition_theorem
dbo:wikiPageWikiLink: dbr:Gallai–Edmonds_decomposition
dbo:wikiPageRedirects: dbr:Gallai–Edmonds_decomposition

Subject Item: wikipedia-en:Gallai–Edmonds_decomposition
foaf:primaryTopic: dbr:Gallai–Edmonds_decomposition