![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Michael D. Barrus
Person information
- affiliation: University of Rhode Island, Kingston, RI, USA
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j22]Michael D. Barrus
, Nathan Haronian:
Cliques in realization graphs. Discret. Math. 346(1): 113184 (2023) - 2022
- [j21]Michael D. Barrus
:
The principal Erdős-Gallai differences of a degree sequence. Discret. Math. 345(4): 112755 (2022) - 2021
- [j20]Michael D. Barrus, Jean A. Guillaume:
Upward-closed hereditary families in the dominance order. Discret. Math. Theor. Comput. Sci. 23(3) (2021)
2010 – 2019
- 2018
- [j19]Michael D. Barrus
, Elizabeth A. Donovan
:
Neighborhood degree lists of graphs. Discret. Math. 341(1): 175-183 (2018) - [j18]Michael D. Barrus
, John Sinkovic:
On 1-uniqueness and dense critical graphs for tree-depth. Discret. Math. 341(7): 1973-1982 (2018) - [j17]Michael D. Barrus:
Weakly threshold graphs. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j16]Michael D. Barrus
:
Adjacency Relationships Forced by a Degree Sequence. Graphs Comb. 34(6): 1411-1427 (2018) - 2017
- [j15]Michael D. Barrus
, Michael Ferrara, Jennifer Vandenbussche, Paul S. Wenger:
Colored Saturation Parameters for Rainbow Subgraphs. J. Graph Theory 86(4): 375-386 (2017) - 2016
- [j14]Michael D. Barrus
, John Sinkovic:
Uniqueness and minimal obstructions for tree-depth. Discret. Math. 339(2): 606-613 (2016) - [j13]Michael D. Barrus
:
On realization graphs of degree sequences. Discret. Math. 339(8): 2146-2152 (2016) - [j12]Michael D. Barrus
, Grant Molnar
:
Graphs with the Strong Havel-Hakimi Property. Graphs Comb. 32(5): 1689-1697 (2016) - 2015
- [j11]Michael D. Barrus
, Stephen G. Hartke
:
Minimal forbidden sets for degree sequence characterizations. Discret. Math. 338(9): 1543-1554 (2015) - [j10]Michael D. Barrus
, Stephen G. Hartke, Mohit Kumbhat:
Non-minimal Degree-Sequence-Forcing Triples. Graphs Comb. 31(5): 1189-1209 (2015) - 2014
- [j9]Michael D. Barrus:
On Fractional Realizations of Graph Degree Sequences. Electron. J. Comb. 21(2): 2 (2014) - 2013
- [j8]Michael D. Barrus
:
Hereditary unigraphs and Erdős-Gallai equalities. Discret. Math. 313(21): 2469-2481 (2013) - 2012
- [j7]Michael D. Barrus
, Stephen G. Hartke, Kyle F. Jao, Douglas B. West:
Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps. Discret. Math. 312(9): 1494-1501 (2012) - [j6]Michael D. Barrus
:
On 2-switches and isomorphism classes. Discret. Math. 312(15): 2217-2222 (2012) - [j5]Michael D. Barrus
:
Havel-Hakimi residues of unigraphs. Inf. Process. Lett. 112(1-2): 44-48 (2012) - [j4]Michael D. Barrus
, Douglas B. West:
The A4-structure of a graph. J. Graph Theory 71(2): 159-175 (2012) - 2010
- [j3]Michael D. Barrus
, Douglas B. West:
Degree-associated reconstruction number of graphs. Discret. Math. 310(20): 2600-2612 (2010) - [j2]Michael D. Barrus
:
Antimagic labeling and canonical decomposition of graphs. Inf. Process. Lett. 110(7): 261-263 (2010)
2000 – 2009
- 2008
- [j1]Michael D. Barrus
, Mohit Kumbhat, Stephen G. Hartke:
Graph classes characterized both by forbidden subgraphs and degree sequences. J. Graph Theory 57(2): 131-148 (2008)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint