AbstractIn this article we present a new version of the Erdős-Gallai theorem concerning graphicness of the degree sequences. The best conditions of all known on the reduction of the number of Erdős-Gallai inequalities are given. Moreover, we prove a criterion of the bipartite graphicness and give a sufficient condition for a sequence to be graphic which does not require checking of any Erdős-Gallai inequality
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
AbstractA simple graph G is said to have property Pk if it contains a complete subgraph of order k+1...
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
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...
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...
AbstractWe show that the Erdős–Gallai condition characterizing graphical degree sequences of length ...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
AbstractIn [A. Tripathi, S. Vijay, A note on a theorem of Erdös & Gallai, Discrete Math. 265 (2003) ...
AbstractIn this paper two main results are obtained. One generalizes the well-known theorem of Erdös...
AbstractErdös and Gallai [2] gave a necessary and sufficient condition for an integer sequence to be...
We give a sufficient condition for a degree sequence to be graphic based onits largest and smallest ...
Abstract. This paper is essentially a discussion of results found in the paper “Two sufficient condi...
We consider a variation of the classical Turán-type extremal problem as introduced by Erdős, Jacob...
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
AbstractA simple graph G is said to have property Pk if it contains a complete subgraph of order k+1...
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
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...
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...
AbstractWe show that the Erdős–Gallai condition characterizing graphical degree sequences of length ...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
AbstractIn [A. Tripathi, S. Vijay, A note on a theorem of Erdös & Gallai, Discrete Math. 265 (2003) ...
AbstractIn this paper two main results are obtained. One generalizes the well-known theorem of Erdös...
AbstractErdös and Gallai [2] gave a necessary and sufficient condition for an integer sequence to be...
We give a sufficient condition for a degree sequence to be graphic based onits largest and smallest ...
Abstract. This paper is essentially a discussion of results found in the paper “Two sufficient condi...
We consider a variation of the classical Turán-type extremal problem as introduced by Erdős, Jacob...
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
AbstractA simple graph G is said to have property Pk if it contains a complete subgraph of order k+1...
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
DOI
Add to ORKG