On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
From MaRDI portal
Publication:5728130
DOI10.1137/0111010zbMath0117.41102OpenAlexW2111147876MaRDI QIDQ5728130
Publication date: 1963
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0111010
Related Items (26)
Making multigraphs simple by a sequence of double edge swaps ⋮ Pruning the search tree in the constructive enumeration of molecular graphs ⋮ Some problems in discrete optimization ⋮ Realizing degree sequences as \(Z_3\)-connected graphs ⋮ Unnamed Item ⋮ On the longest flip sequence to untangle segments in the plane ⋮ Complexity results on untangling red-blue matchings ⋮ Characterization of Digraphic Sequences with Strongly Connected Realizations ⋮ On unigraphic polyhedra with one vertex of degree \({p-2}\) ⋮ Semi-regular graphs of minimum independence number ⋮ Approximating Shortest Connected Graph Transformation for Trees ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ Degree realization of undirected graphs in reduced form ⋮ On the realization of a (p,s)-digraph with prescribed degrees ⋮ Graphic sequences with unique realization ⋮ Relations between graphs and integer-pair sequences ⋮ Improvements in performance and security for complex networks ⋮ On the degrees of the vertices of a directed graph ⋮ Conditions for sequences to be r-graphic ⋮ The Perfect Matching Reconfiguration Problem ⋮ On the planarity of regular incidence sequences ⋮ On d-invariant transformations of (\(p,s\))-digraphs ⋮ Algorithms for constructing graphs and digraphs with given valences and factors ⋮ A polynomial dual of partitions ⋮ Cliques in realization graphs ⋮ A property of adjacency matrices of realizations of pair sequences
This page was built for publication: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
