Publication date
December 1976
DOI Publisher
Published by Elsevier Inc. ISSN
0095-8956Abstract
Pairs of sequences which have a unique realization by bipartite graphs (up to isomorphism) are characterized
Pairs of sequences which have a unique realization by bipartite graphs (up to isomorphism) are characterized
Since the introduction of the concepts of chromatically unique graphs and chromatically equivalent ...
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
AbstractGiven a bipartite graph G, and a sequence H=(h1, h2,…, hn) of positive integers, necessary c...
Sequences with unique realizations (up to isomorphism) by simple graphs are characterized, partly by...
Pairs of sequences which have a unique realization by bipartite graphs (up to isomorphism) are chara...
AbstractA realization of an integer sequence means a graph which has this sequence as its degree seq...
AbstractIn this paper, we characterise all graphic bipartitioned sequences for which there is at lea...
AbstractIn this paper we characterise all graphic bipartitioned sequences for which there is at leas...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
AbstractGiven a graph (digraph) G with edge (arc) set E(G) = {(u1}, υ1), (u2, υ2),⋯,(uq, υq, where q...
AbstractWe prove the chromatic uniqueness of the following infinite families of bipartite graphs: Km...
As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is pr...
Since the introduction of the concepts of chromatically unique graphs and chromatically equivalent ...
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
AbstractGiven a bipartite graph G, and a sequence H=(h1, h2,…, hn) of positive integers, necessary c...
Sequences with unique realizations (up to isomorphism) by simple graphs are characterized, partly by...
Pairs of sequences which have a unique realization by bipartite graphs (up to isomorphism) are chara...
AbstractA realization of an integer sequence means a graph which has this sequence as its degree seq...
AbstractIn this paper, we characterise all graphic bipartitioned sequences for which there is at lea...
AbstractIn this paper we characterise all graphic bipartitioned sequences for which there is at leas...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
AbstractGiven a graph (digraph) G with edge (arc) set E(G) = {(u1}, υ1), (u2, υ2),⋯,(uq, υq, where q...
AbstractWe prove the chromatic uniqueness of the following infinite families of bipartite graphs: Km...
As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is pr...
Since the introduction of the concepts of chromatically unique graphs and chromatically equivalent ...
AbstractA list of nonnegative integers is graphic if it is the list of vertex degrees of a graph. Er...
AbstractGiven a bipartite graph G, and a sequence H=(h1, h2,…, hn) of positive integers, necessary c...
Add to ORKG