AbstractA realization of an integer sequence means a graph which has this sequence as its degree sequence. This paper gives some characterizations of the sequences with unique labeled realization and also provides an effcient algorithm for testing if a sequence has a unique unlabeled realization
A sequence $d$ of integers is a degree sequence if there exists a (simple) graph $G$ such that the c...
Abstract. This paper is essentially a discussion of results found in the paper “Two sufficient condi...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
AbstractA realization of an integer sequence means a graph which has this sequence as its degree seq...
Sequences with unique realizations (up to isomorphism) by simple graphs are characterized, partly by...
AbstractIn this paper we use the concept of integer-pair sequences, an invariant of graphs and digra...
Pairs of sequences which have a unique realization by bipartite graphs (up to isomorphism) are chara...
AbstractGiven a graph (digraph) G with edge (arc) set E(G) = {(u1}, υ1), (u2, υ2),⋯,(uq, υq, where q...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
AbstractA graph is called simple if it is the only realization of its degree sequences. The simple g...
Given the degree sequence d of a graph, the realization graph of d is the graph having as its vertic...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
AbstractA nonincreasing sequence of nonnegative integers π=(d1,d2,…,dn) is graphic if there is a (si...
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
AbstractIn this paper two main results are obtained. One generalizes the well-known theorem of Erdös...
A sequence $d$ of integers is a degree sequence if there exists a (simple) graph $G$ such that the c...
Abstract. This paper is essentially a discussion of results found in the paper “Two sufficient condi...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
AbstractA realization of an integer sequence means a graph which has this sequence as its degree seq...
Sequences with unique realizations (up to isomorphism) by simple graphs are characterized, partly by...
AbstractIn this paper we use the concept of integer-pair sequences, an invariant of graphs and digra...
Pairs of sequences which have a unique realization by bipartite graphs (up to isomorphism) are chara...
AbstractGiven a graph (digraph) G with edge (arc) set E(G) = {(u1}, υ1), (u2, υ2),⋯,(uq, υq, where q...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
AbstractA graph is called simple if it is the only realization of its degree sequences. The simple g...
Given the degree sequence d of a graph, the realization graph of d is the graph having as its vertic...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
AbstractA nonincreasing sequence of nonnegative integers π=(d1,d2,…,dn) is graphic if there is a (si...
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
AbstractIn this paper two main results are obtained. One generalizes the well-known theorem of Erdös...
A sequence $d$ of integers is a degree sequence if there exists a (simple) graph $G$ such that the c...
Abstract. This paper is essentially a discussion of results found in the paper “Two sufficient condi...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
DOI
Add to ORKG