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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Fulkerson–Chen–Anstee_theorem
dbo:wikiPageWikiLink
dbr:Digraph_realization_problem
Subject Item
dbr:Digraph_realization_problem
rdfs:label
Digraph realization problem
rdfs:comment
The digraph realization problem is a decision problem in graph theory. Given pairs of nonnegative integers , the problem asks whether there is a labeled simple directed graph such that each vertex has indegree and outdegree .
dcterms:subject
dbc:Computational_problems_in_graph_theory
dbo:wikiPageID
43236507
dbo:wikiPageRevisionID
1060013973
dbo:wikiPageWikiLink
dbr:Bipartite_realization_problem dbr:Bipartite_graph dbr:Kleitman–Wang_algorithms dbr:Fulkerson–Chen–Anstee_theorem dbr:Directed_graph dbr:Integer dbr:Contingency_table dbr:Adjacency_matrix dbr:Multigraph dbr:NP-complete dbr:Graph_theory dbr:Vertex_(graph_theory) dbr:P_(complexity) dbr:Graph_realization_problem dbc:Computational_problems_in_graph_theory dbr:Degree_(graph_theory) dbr:Sequence_(graph_theory) dbr:Matrix_(mathematics) dbr:Decision_problem dbr:Recursion_(computer_science) dbr:Polynomial-time_approximation_scheme
owl:sameAs
freebase:m.0114ld1z yago-res:Digraph_realization_problem wikidata:Q18206559 n14:m2Ga
dbp:wikiPageUsesTemplate
dbt:Harvs dbt:Citation dbt:Harvtxt
dbp:authorlink
Catherine Greenhill
dbp:first
Catherine
dbp:last
Greenhill
dbp:year
2011
dbo:abstract
The digraph realization problem is a decision problem in graph theory. Given pairs of nonnegative integers , the problem asks whether there is a labeled simple directed graph such that each vertex has indegree and outdegree .
prov:wasDerivedFrom
wikipedia-en:Digraph_realization_problem?oldid=1060013973&ns=0
dbo:wikiPageLength
4062
foaf:isPrimaryTopicOf
wikipedia-en:Digraph_realization_problem
Subject Item
dbr:Directed_graph
dbo:wikiPageWikiLink
dbr:Digraph_realization_problem
Subject Item
dbr:Graph_realization_problem
dbo:wikiPageWikiLink
dbr:Digraph_realization_problem
Subject Item
dbr:Bipartite_realization_problem
dbo:wikiPageWikiLink
dbr:Digraph_realization_problem
Subject Item
dbr:Kleitman–Wang_algorithms
dbo:wikiPageWikiLink
dbr:Digraph_realization_problem
Subject Item
wikipedia-en:Digraph_realization_problem
foaf:primaryTopic
dbr:Digraph_realization_problem