The following pages link to Michael D. Barrus (Q284752):
Displayed 27 items.
- On realization graphs of degree sequences (Q284753) (← links)
- Graphs with the strong Havel-Hakimi property (Q343704) (← links)
- Hereditary unigraphs and Erdős-Gallai equalities (Q389468) (← links)
- On fractional realizations of graph degree sequences (Q405210) (← links)
- Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps (Q411650) (← links)
- On 2-switches and isomorphism classes (Q442300) (← links)
- Non-minimal degree-sequence-forcing triples (Q497308) (← links)
- Degree-associated reconstruction number of graphs (Q709303) (← links)
- Havel-Hakimi residues of unigraphs (Q763488) (← links)
- Uniqueness and minimal obstructions for tree-depth (Q898117) (← links)
- Antimagic labeling and canonical decomposition of graphs (Q991774) (← links)
- On 1-uniqueness and dense critical graphs for tree-depth (Q1752669) (← links)
- Adjacency relationships forced by a degree sequence (Q1756108) (← links)
- The principal Erdős-Gallai differences of a degree sequence (Q2075508) (← links)
- Cliques in realization graphs (Q2092412) (← links)
- Graphs with few trivial characteristic ideals (Q2229515) (← links)
- Minimal forbidden sets for degree sequence characterizations (Q2344782) (← links)
- Neighborhood degree lists of graphs (Q2411614) (← links)
- The A4-structure of a graph (Q2911060) (← links)
- Weakly threshold graphs (Q4560238) (← links)
- Colored Saturation Parameters for Rainbow Subgraphs (Q4596322) (← links)
- Upward-closed hereditary families in the dominance order (Q5024680) (← links)
- Graph classes characterized both by forbidden subgraphs and degree sequences (Q5441407) (← links)
- Uniqueness and minimal obstructions for tree-depth (Q6245338) (← links)
- Minimal obstructions for tree-depth: A non-1-unique example (Q6272133) (← links)
- Distinguishing chromatic number of Hamiltonian circulant graphs (Q6430688) (← links)
- The Hereditary Closure of the Unigraphs (Q6448390) (← links)