{"version":"1.0","type":"link","title":"Digraph realization problem - Newikis","description":"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 .","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/2/23/Digraph_realization.svg/1280px-Digraph_realization.svg.png","thumbnail_width":1280,"thumbnail_height":1183}