| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418554 | Discrete Applied Mathematics | 2011 | 5 Pages |
Abstract
A list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Erdős–Gallai characterized graphic lists, and Gale and Ryser, independently, provided one for a bipartite graph, given two lists of nonnegative integers. We give a constructive proof of an extension of these two results.
► We provide constructive proofs of two theorems on graphic lists. ► The first construction deals with an extension of the Erdős–Gallai theorem. ► The second construction deals with the theorem of Gale and Ryser. ► Both constructions are based on a recent constructive proof of the first result.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ankit Garg, Arpit Goel, Amitabha Tripathi,