Pairs of sequences with a unique realization by bipartite graphs

DOI10.1016/S0095-8956(76)80006-8zbMath0298.05139MaRDI QIDQ1214447

Michael Koren

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (10)

Unnamed Item ⋮ Unnamed Item ⋮ Graph isomorphism, color refinement, and compactness ⋮ Hereditary unigraphs and Erdős-Gallai equalities ⋮ On the Power of Color Refinement ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ Characterization of unigraphic and unidigraphic integer-pair sequences ⋮ Graphs and degree sequences. I ⋮ Sequences with a unique realization by simple graphs ⋮ Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences

Cites Work

• Unnamed Item
• A theorem on flows in networks
• 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

This page was built for publication: Pairs of sequences with a unique realization by bipartite graphs