DOIAbstract
AbstractErdös and Gallai [2] gave a necessary and sufficient condition for an integer sequence to be the degree sequence of a simple graph. We present a proof of this criterion based on the theory of symmetric functions
AbstractErdös and Gallai [2] gave a necessary and sufficient condition for an integer sequence to be the degree sequence of a simple graph. We present a proof of this criterion based on the theory of symmetric functions
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
A sequence d of integers is a degree sequence if there exists a (simple) graph G such that the compo...
AbstractIn this paper we use the concept of integer-pair sequences, an invariant of graphs and digra...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
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...
Let a1,a2,...,an, and b1,b2,...,bn be integers with 0 ≤ ai ≤ bi for i = 1,2,...,n. The purpose of th...
AbstractIn this article we present a new version of the Erdős-Gallai theorem concerning grap...
AbstractLet a1,a2,…,an and b1,b2,…,bn be integers with 0⩽ai⩽bi for i=1,2,…,n. The purpose of this no...
In this article we present a new version of the Erdős-Gallai theorem concerning graphicness ...
AbstractWe show that the Erdős–Gallai condition characterizing graphical degree sequences of length ...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
This thesis focuses on the intersection of two classical and fundamental areas in graph theory: grap...
AbstractKnown necessary conditions for realization of a sequence of integers as the degrees of a sel...
Degree sequences of some types of graphs will be studied and characterized in this paper
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
A sequence d of integers is a degree sequence if there exists a (simple) graph G such that the compo...
AbstractIn this paper we use the concept of integer-pair sequences, an invariant of graphs and digra...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
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...
Let a1,a2,...,an, and b1,b2,...,bn be integers with 0 ≤ ai ≤ bi for i = 1,2,...,n. The purpose of th...
AbstractIn this article we present a new version of the Erdős-Gallai theorem concerning grap...
AbstractLet a1,a2,…,an and b1,b2,…,bn be integers with 0⩽ai⩽bi for i=1,2,…,n. The purpose of this no...
In this article we present a new version of the Erdős-Gallai theorem concerning graphicness ...
AbstractWe show that the Erdős–Gallai condition characterizing graphical degree sequences of length ...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
This thesis focuses on the intersection of two classical and fundamental areas in graph theory: grap...
AbstractKnown necessary conditions for realization of a sequence of integers as the degrees of a sel...
Degree sequences of some types of graphs will be studied and characterized in this paper
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
A sequence d of integers is a degree sequence if there exists a (simple) graph G such that the compo...
AbstractIn this paper we use the concept of integer-pair sequences, an invariant of graphs and digra...
Add to ORKG