Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
  • A. Berger
  • Discret. Math.
  • 2014
  • Corpus ID: 119170629
2012
2012
We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence $S:={a_1 \choose b_1… 
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…