Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.dam.2011.06.017 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Graphic,Bigraphic,Realization,Lexicographic ordering,Good order | Complete bipartite graph,Discrete mathematics,Combinatorics,Constructive proof,Edge-transitive graph,Vertex (geometry),Constructive,Simplex graph,Bipartite graph,Lexicographical order,Mathematics | Journal |
Volume | Issue | ISSN |
159 | 17 | 0166-218X |
Citations | PageRank | References |
1 | 0.48 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ankit Garg | 1 | 125 | 16.19 |
| Arpit Goel | 2 | 1 | 0.48 |
| Amitabha Tripathi | 3 | 37 | 9.02 |