About: Digraph realization problem

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 .

Property Value
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 . (en)
dbo:wikiPageID
  • 43236507 (xsd:integer)
dbo:wikiPageLength
  • 4062 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1060013973 (xsd:integer)
dbo:wikiPageWikiLink
dbp:authorlink
  • Catherine Greenhill (en)
dbp:first
  • Catherine (en)
dbp:last
  • Greenhill (en)
dbp:wikiPageUsesTemplate
dbp:year
  • 2011 (xsd:integer)
dcterms:subject
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 . (en)
rdfs:label
  • Digraph realization problem (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License