Sequences with a unique realization by simple graphs

DOI10.1016/S0095-8956(76)80007-XzbMath0298.05140OpenAlexW2110773169MaRDI QIDQ1214448

Michael Koren

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/s0095-8956(76)80007-x

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (15)

Unnamed Item ⋮ Hereditary unigraphs and Erdős-Gallai equalities ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ On unigraphic polyhedra with one vertex of degree \({p-2}\) ⋮ Characterization of unigraphic and unidigraphic integer-pair sequences ⋮ Properties of unique realizations - a survey ⋮ Constructing and sampling directed graphs with given degree sequences ⋮ Graphs and degree sequences. I ⋮ Graphs with degrees from prescribed intervals ⋮ Characterization of self-complementary graphs with 2-factors ⋮ Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) ⋮ Frequency partitions: Forcibly pancyclic and forcibly nonhamiltonian degree sequences ⋮ Solution of the Hamiltonian problem for self-complementary graphs ⋮ The principal Erdős-Gallai differences of a degree sequence ⋮ Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences

Cites Work

• Pairs of sequences with a unique realization by bipartite graphs
• Graphic sequences with unique realization
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Unnamed Item

This page was built for publication: Sequences with a unique realization by simple graphs