Extreme degree sequences of simple graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3363588 (Why is no real title available?)
- The Factors of Graphs
Cited in
(26)- The convex hull of degree sequences of signed graphs
- b-matching degree-sequence polyhedra
- An inequality for degree sequences
- Graphic sequences with unique realization
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
- Extremal graphs for weights
- Degree sequences and majorization
- Total matchings and total coverings of threshold graphs
- Longest cycles in threshold graphs
- The polytope of degree sequences of hypergraphs
- Split graphs
- Realization of a sum of sequences by a sum graph
- On degree sequences of undirected, directed, and bidirected graphs
- Some approaches for solving the general (t,k)-design existence problem and other related problems
- Rao's degree sequence conjecture
- Spectral Integral Variations of Degree Maximal Graphs
- Optimization over degree sequences
- The polytope of degree sequences
- Difference graphs
- Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
- When the degree sequence is a sufficient statistic
- Convex polytopes and enumeration
- Bipartite bithreshold graphs
- Degree sequence optimization and extremal degree enumerators
- Large induced subgraphs of random graphs with given degree sequences
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
This page was built for publication: Extreme degree sequences of simple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562798)
