Michael D. Barrus

Orcid: 0000-0003-1435-5673

Affiliations:
  • University of Rhode Island, Kingston, RI, USA


According to our database1, Michael D. Barrus authored at least 22 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Cliques in realization graphs.
Discret. Math., 2023

2022
The principal Erdős-Gallai differences of a degree sequence.
Discret. Math., 2022

2021
Upward-closed hereditary families in the dominance order.
Discret. Math. Theor. Comput. Sci., 2021

2018
Adjacency Relationships Forced by a Degree Sequence.
Graphs Comb., 2018

Weakly threshold graphs.
Discret. Math. Theor. Comput. Sci., 2018

On 1-uniqueness and dense critical graphs for tree-depth.
Discret. Math., 2018

Neighborhood degree lists of graphs.
Discret. Math., 2018

2017
Colored Saturation Parameters for Rainbow Subgraphs.
J. Graph Theory, 2017

2016
Graphs with the Strong Havel-Hakimi Property.
Graphs Comb., 2016

Uniqueness and minimal obstructions for tree-depth.
Discret. Math., 2016

On realization graphs of degree sequences.
Discret. Math., 2016

2015
Non-minimal Degree-Sequence-Forcing Triples.
Graphs Comb., 2015

Minimal forbidden sets for degree sequence characterizations.
Discret. Math., 2015

2014
On Fractional Realizations of Graph Degree Sequences.
Electron. J. Comb., 2014

2013
Hereditary unigraphs and Erdős-Gallai equalities.
Discret. Math., 2013

2012
The <i>A</i>4-structure of a graph.
J. Graph Theory, 2012

Havel-Hakimi residues of unigraphs.
Inf. Process. Lett., 2012

Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps.
Discret. Math., 2012

On 2-switches and isomorphism classes.
Discret. Math., 2012

2010
Antimagic labeling and canonical decomposition of graphs.
Inf. Process. Lett., 2010

Degree-associated reconstruction number of graphs.
Discret. Math., 2010

2008
Graph classes characterized both by forbidden subgraphs and degree sequences.
J. Graph Theory, 2008


  Loading...