The following pages link to (Q3230887):
Displayed 35 items.
- The polytope of degree sequences (Q584289) (← links)
- A family of switch equivalent graphs (Q704278) (← links)
- Conditions for sequences to be r-graphic (Q759166) (← links)
- On the least size of a graph with a given degree set (Q860412) (← links)
- Nontraceable detour graphs (Q868352) (← links)
- A short proof of a theorem on degree sets of graphs (Q875603) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- Graphic sequences with a realization containing a union of cliques (Q995771) (← links)
- Graphic sequences with a realization containing a generalized friendship graph (Q998359) (← links)
- Degree sequence and supereulerian graphs (Q998406) (← links)
- A simple criterion on degree sequences of graphs (Q1003744) (← links)
- A remark on degree sequences of multigraphs (Q1014317) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- The convex hull of degree sequences of signed graphs (Q1045125) (← links)
- Graphic sequences with unique realization (Q1219896) (← links)
- Eccentric sequences and eccentric sets in graphs (Q1240739) (← links)
- Construction of Hamiltonian graphs and bigraphs with prescribed degrees (Q1251235) (← links)
- Independence and the Havel-Hakimi residue (Q1322229) (← links)
- Degree sequences and majorization (Q1322868) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- An algorithm to generate tournament score sequences (Q1410980) (← links)
- A lower bound on the independence number of a graph (Q1584341) (← links)
- A note on a theorem of Erdős and Gallai (Q1874382) (← links)
- On existence of hypergraphs with prescribed edge degree profile (Q1903722) (← links)
- Pruning the search tree in the constructive enumeration of molecular graphs (Q1917340) (← links)
- Rounding in symmetric matrices and undirected graphs (Q1923592) (← links)
- Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence (Q1957375) (← links)
- Sufficient degree conditions for<i>k</i>-edge-connectedness of a graph (Q3057109) (← links)
- Uniform Sampling of Digraphs with a Fixed Degree Sequence (Q3057627) (← links)
- (Q3812278) (← links)
- Degree Sequences in Complexes and Hypergraphs (Q4085762) (← links)
- Extremal problems for chromatic neighborhood sets (Q4537556) (← links)
- (Q4697508) (← links)
- (Q5708560) (← links)
- Every planar graph with nine points has a nonplanar complement (Q5721708) (← links)