default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuth Haas
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Cheryl Grood, Ruth Haas, Bonnie C. Jacob, Erika L. C. King, Shahla Nasserasr:
Well-Forced Graphs. Graphs Comb. 40(6): 129 (2024)- 2023
- [j27]Jesse Geneson, Ruth Haas, Leslie Hogben
:
Reconfiguration graphs of zero forcing sets. Discret. Appl. Math. 329: 126-139 (2023) - [j26]Novi H. Bong, Joshua Carlson, Bryan Curtis, Ruth Haas, Leslie Hogben:
Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters. Graphs Comb. 39(4): 86 (2023) - 2022
- [j25]sarah-marie belcastro, Ruth Haas:
Grünbaum colorings extended to non-facial 3-cycles. Electron. J. Graph Theory Appl. 10(1): 199 (2022) - [j24]Kira V. Adaricheva, Heather C. Smith Blake, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Karen Seyffarth:
Hamilton Paths in Dominating Graphs of Trees and Cycles. Graphs Comb. 38(6): 174 (2022) - [j23]Illya V. Hicks, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David Roberson, Logan A. Smith:
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph. INFORMS J. Comput. 34(6): 2868-2872 (2022) - 2021
- [j22]sarah-marie belcastro, Ruth Haas:
Color-induced subgraphs of Grünbaum colorings of triangulations. Australas. J Comb. 79: 461-475 (2021) - 2020
- [i1]Jesse Geneson, Ruth Haas, Leslie Hogben:
Reconfiguration graphs of zero forcing sets. CoRR abs/2009.00220 (2020)
2010 – 2019
- 2018
- [j21]Ruth Haas, Gary MacGillivray:
Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. Algorithms 11(4): 40 (2018) - [j20]John Asplund, Kossi D. Edoh, Ruth Haas, Yulia Hristova, Beth Novick, Brett Werner:
Reconfiguration graphs of shortest paths. Discret. Math. 341(10): 2938-2948 (2018) - 2017
- [j19]Ruth Haas, Karen Seyffarth:
Reconfiguring dominating sets in some well-covered and other classes of graphs. Discret. Math. 340(8): 1802-1817 (2017) - 2016
- [j18]Julie Beier, Janet Fierson, Ruth Haas, Heather M. Russell, Kara Walcher Shavo:
Classifying coloring graphs. Discret. Math. 339(8): 2100-2112 (2016) - 2015
- [j17]sarah-marie belcastro, Ruth Haas:
Triangle-free Uniquely 3-Edge Colorable Cubic Graphs. Contributions Discret. Math. 10(2) (2015) - 2014
- [j16]Sarah-Marie Belcastro, Ruth Haas:
Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs. Discret. Math. 325: 77-84 (2014) - [j15]Ruth Haas, Karen Seyffarth:
The k-Dominating Graph. Graphs Comb. 30(3): 609-617 (2014) - 2012
- [j14]Ruth Haas:
The canonical coloring graph of trees and cycles. Ars Math. Contemp. 5(1): 149-157 (2012) - [j13]Ruth Haas, Michael Young:
The anti-Ramsey number of perfect matching. Discret. Math. 312(5): 933-937 (2012) - 2010
- [j12]Michael O. Albertson, Hannah Alpert, sarah-marie belcastro, Ruth Haas:
Grünbaum colorings of toroidal triangulations. J. Graph Theory 63(1): 68-81 (2010)
2000 – 2009
- 2005
- [j11]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1-2): 31-61 (2005) - 2004
- [j10]Ruth Haas, Thomas B. Wexler:
Signed domination numbers of a graph and its complement. Discret. Math. 283(1-3): 87-92 (2004) - 2003
- [j9]Ruth Haas, Denis Hanson, Gary MacGillivray:
Bounds For Partial List Colourings. Ars Comb. 67 (2003) - [c1]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. SCG 2003: 154-163 - 2002
- [j8]Ruth Haas:
Characterizations of arboricity of graphs. Ars Comb. 63 (2002) - [j7]Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary MacGillivray:
Star forests, dominating sets and Ramsey-type problems. Discret. Math. 245(1-3): 255-262 (2002) - [j6]Ruth Haas, Thomas B. Wexler:
Bounds on the signed domination number of a graph. Electron. Notes Discret. Math. 11: 742-750 (2002) - 2000
- [j5]Michael O. Albertson, Sara Grossman, Ruth Haas:
Partial list colorings. Discret. Math. 214(1-3): 235-240 (2000)
1990 – 1999
- 1997
- [j4]Michael O. Albertson, Ruth Haas:
The edge chromatic difference sequence of a cubic graph. Discret. Math. 177(1-3): 1-8 (1997) - 1996
- [j3]Michael O. Albertson, Ruth Haas:
Parsimonious edge coloring. Discret. Math. 148(1-3): 1-7 (1996) - [j2]Michael O. Albertson, Ruth Haas:
Bounding Functions and Rigid Graphs. SIAM J. Discret. Math. 9(2): 269-273 (1996) - 1993
- [j1]Michael O. Albertson, Lily Chan, Ruth Haas:
Independence and graph homomorphisms graph homomorphisms. J. Graph Theory 17(5): 581-588 (1993)
Coauthor Index
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-12-01 01:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
