Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a simple graph with the given integer sequence as degree sequence. One of the criteria leads to a new and constructive proof of the well-known criterion of Erdös-Gallai
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a s...
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a s...
In this article we present a new version of the Erdős-Gallai theorem concerning graphicness ...
AbstractIn this article we present a new version of the Erdős-Gallai theorem concerning grap...
AbstractGiven a graph (digraph) G with edge (arc) set E(G) = {(u1}, υ1), (u2, υ2),⋯,(uq, υq, where q...
Abstract. An integer sequence pi is said to be graphic if it is the degree sequence of some simple g...
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
AbstractErdös and Gallai [2] gave a necessary and sufficient condition for an integer sequence to be...
AbstractA realization of an integer sequence means a graph which has this sequence as its degree seq...
Abstract. This paper is essentially a discussion of results found in the paper “Two sufficient condi...
AbstractIn this paper two main results are obtained. One generalizes the well-known theorem of Erdös...
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a s...
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a s...
In this article we present a new version of the Erdős-Gallai theorem concerning graphicness ...
AbstractIn this article we present a new version of the Erdős-Gallai theorem concerning grap...
AbstractGiven a graph (digraph) G with edge (arc) set E(G) = {(u1}, υ1), (u2, υ2),⋯,(uq, υq, where q...
Abstract. An integer sequence pi is said to be graphic if it is the degree sequence of some simple g...
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
AbstractErdös and Gallai [2] gave a necessary and sufficient condition for an integer sequence to be...
AbstractA realization of an integer sequence means a graph which has this sequence as its degree seq...
Abstract. This paper is essentially a discussion of results found in the paper “Two sufficient condi...
AbstractIn this paper two main results are obtained. One generalizes the well-known theorem of Erdös...
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
DOI
Add to ORKG