Digraph realization problem

The digraph realization problem is a decision problem in graph theory. Given pairs of nonnegative integers , the problem asks whether there is a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Abstract Given pairs ( a 1 , b 1 ) , … , ( a n , b n ) of nonnegative integers, the digraph realization problem for digraphs asks… (More)
  • figure 1
Is this relevant?
2012
2012
We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n… (More)
  • figure 1
  • figure 3
  • table 1
  • figure 4
  • figure 6
Is this relevant?
2012
2012
The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or… (More)
Is this relevant?
2009
2009
Given a digraph D, the set of all pairs (N^-(v),N^+(v)) constitutes the neighborhood dihypergraph N(D) of D. The Digraph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?