Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences

DOI10.1016/0012-365X(83)90175-9zbMath0513.05054MaRDI QIDQ1050376

Prabir Das

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

degree sequencesdegree- pair sequencesinteger-pair sequenceunique realizability

Mathematics Subject Classification ID

Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items

Matrices with prescribed row, column and block sums ⋮ Graphs and degree sequences. I

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of unigraphic and unidigraphic integer-pair sequences
• Pairs of sequences with a unique realization by bipartite graphs
• Sequences with a unique realization by simple graphs
• On the realization of a (p,s)-digraph with prescribed degrees
• Graphic sequences with unique realization
• Relations between graphs and integer-pair sequences
• Parallel concepts in graph theory
• On the degrees of the vertices of a directed graph
• Algorithms for constructing graphs and digraphs with given valences and factors
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A Note on Unigraphic Sequences
• Some Properties of Graphs with Multiple Edges

This page was built for publication: Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences