AbstractLet a1,a2,…,an and b1,b2,…,bn be integers with 0⩽ai⩽bi for i=1,2,…,n. The purpose of this note is to give a good characterization for the existence of a simple graph G with vertices v1,v2,…,vn such that ai⩽dG(vi)⩽bi for i=1,2,…,n. This solves a research problem posed by Niessen and generalizes an Erdős–Gallai theorem
Degree sequences of some types of graphs will be studied and characterized in this paper
Abstract. We consider the following fundamental realization problem of directed graphs. Given a sequ...
AbstractA nonnegative integer sequence (d1,d2,…,dn) is called a degree sequence if there exists a si...
Let a1,a2,...,an, and b1,b2,...,bn be integers with 0 ≤ ai ≤ bi for i = 1,2,...,n. The purpose of th...
Graph TheoryLet (a1,a2,\textellipsis,an) and (b1,b2,\textellipsis,bn) be two sequences of nonnegativ...
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 the paper we report on the parallel enumeration of the degree sequences (their number is denoted ...
AbstractErdös and Gallai [2] gave a necessary and sufficient condition for an integer sequence to be...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
In 1962, S. L. Hakimi proved necessary and sufficient conditions for a given sequence of positive in...
AbstractFor k an integer, let G(a, b, k) denote a simple bipartite graph with bipartition (A, B) whe...
AbstractWei discovered that the stability number, α(G), of a graph, G, with degree sequence d1, d2,…...
A sequence d = (d1, d2, …, dn) of integers is a degree sequence if there exists a (simple) graph G s...
AbstractFor a finite simple graph G, we denote the set of degrees of its vertices, known as its degr...
Degree sequences of some types of graphs will be studied and characterized in this paper
Abstract. We consider the following fundamental realization problem of directed graphs. Given a sequ...
AbstractA nonnegative integer sequence (d1,d2,…,dn) is called a degree sequence if there exists a si...
Let a1,a2,...,an, and b1,b2,...,bn be integers with 0 ≤ ai ≤ bi for i = 1,2,...,n. The purpose of th...
Graph TheoryLet (a1,a2,\textellipsis,an) and (b1,b2,\textellipsis,bn) be two sequences of nonnegativ...
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 the paper we report on the parallel enumeration of the degree sequences (their number is denoted ...
AbstractErdös and Gallai [2] gave a necessary and sufficient condition for an integer sequence to be...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
In 1962, S. L. Hakimi proved necessary and sufficient conditions for a given sequence of positive in...
AbstractFor k an integer, let G(a, b, k) denote a simple bipartite graph with bipartition (A, B) whe...
AbstractWei discovered that the stability number, α(G), of a graph, G, with degree sequence d1, d2,…...
A sequence d = (d1, d2, …, dn) of integers is a degree sequence if there exists a (simple) graph G s...
AbstractFor a finite simple graph G, we denote the set of degrees of its vertices, known as its degr...
Degree sequences of some types of graphs will be studied and characterized in this paper
Abstract. We consider the following fundamental realization problem of directed graphs. Given a sequ...
AbstractA nonnegative integer sequence (d1,d2,…,dn) is called a degree sequence if there exists a si...
DOI
Add to ORKG