Extreme degree sequences of simple graphs
From MaRDI portal
Publication:2562798
DOI10.1016/0095-8956(73)90037-3zbMath0268.05123OpenAlexW1988103993MaRDI QIDQ2562798
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(73)90037-3
Related Items (24)
Total matchings and total coverings of threshold graphs ⋮ Split graphs ⋮ On degree sequences of undirected, directed, and bidirected graphs ⋮ Longest cycles in threshold graphs ⋮ Optimization over Degree Sequences ⋮ Some approaches for solving the general (\(t,k\))-design existence problem and other related problems ⋮ Rao's degree sequence conjecture ⋮ Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph ⋮ When the degree sequence is a sufficient statistic ⋮ \(b\)-matching degree-sequence polyhedra ⋮ Difference graphs ⋮ Convex polytopes and enumeration ⋮ An inequality for degree sequences ⋮ Bipartite bithreshold graphs ⋮ A short constructive proof of the Erdős-Gallai characterization of graphic lists ⋮ Realization of a sum of sequences by a sum graph ⋮ Graphic sequences with unique realization ⋮ The polytope of degree sequences ⋮ Spectral Integral Variations of Degree Maximal Graphs ⋮ The convex hull of degree sequences of signed graphs ⋮ The realization graph of a degree sequence with majorization gap 1 is Hamiltonian ⋮ Extremal graphs for weights ⋮ Degree sequences and majorization ⋮ The polytope of degree sequences of hypergraphs
Cites Work
This page was built for publication: Extreme degree sequences of simple graphs