Graph realization problem
Problem
The graph realization problem is a decision problem in graph theory. Given a finite sequence of natural numbers, the problem asks whether there is a labeled simple graph such that is the degree sequence of this graph.
Further reading
- Wikipedia, page 43304622, revision 1298050546, Graph realization problem. adopted
About this page
| Tag | SVX1CQ4CR2 |
|---|---|
| URI | m2://SVX1CQ4CR2 |
| Aliases | graph-realizability |
| Kind | problem |
| Writing | W1 stated |
| Status | This copy of the site has no build data. Run m2 status SVX1CQ4CR2. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge bounds both (0 of 1)
- section History: with the year of the first source (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.