The following pages link to The polytope of degree sequences (Q584289):
Displaying 22 items.
- Some approaches for solving the general (\(t,k\))-design existence problem and other related problems (Q385139) (← links)
- On fractional realizations of graph degree sequences (Q405210) (← links)
- Convex polytopes and enumeration (Q675901) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- Unoriented Laplacian maximizing graphs are degree maximal (Q932145) (← links)
- \(b\)-matching degree-sequence polyhedra (Q1180424) (← links)
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian (Q1300907) (← links)
- Degree sequences and majorization (Q1322868) (← links)
- Total matchings and total coverings of threshold graphs (Q1327237) (← links)
- Longest cycles in threshold graphs (Q1343260) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- The polytope of degree sequences of hypergraphs (Q1611881) (← links)
- Adjacency relationships forced by a degree sequence (Q1756108) (← links)
- Split graphs (Q1873776) (← links)
- The Burge correspondence and crystal graphs (Q2107508) (← links)
- Graphs with maximal signless Laplacian spectral radius (Q2267405) (← links)
- On degree sequences of undirected, directed, and bidirected graphs (Q2359981) (← links)
- Geometry of paired comparisons (Q2371611) (← links)
- Shifted simplicial complexes are Laplacian integral (Q3151233) (← links)
- Spectral Integral Variations of Degree Maximal Graphs (Q4458106) (← links)
- Optimization over Degree Sequences (Q4579955) (← links)
- Difference graphs (Q5895304) (← links)
