Ruth Haas

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 11

Top Topics

Directed Acyclic

Equivalence Classes

Top Venues

Contributions Discret. Math.

Publications

Jesse Geneson, Ruth Haas, Leslie Hogben
Reconfiguration graphs of zero forcing sets. Discret. Appl. Math. 329 (2023)
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) (2023)
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) (2022)
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) (2022)
sarah-marie belcastro, Ruth Haas
Grünbaum colorings extended to non-facial 3-cycles. Electron. J. Graph Theory Appl. 10 (1) (2022)
sarah-marie belcastro, Ruth Haas
Color-induced subgraphs of Grünbaum colorings of triangulations. Australas. J Comb. 79 (2021)
Jesse Geneson, Ruth Haas, Leslie Hogben
Reconfiguration graphs of zero forcing sets. CoRR (2020)
John Asplund, Kossi D. Edoh, Ruth Haas, Yulia Hristova, Beth Novick, Brett Werner
Reconfiguration graphs of shortest paths. Discret. Math. 341 (10) (2018)
Ruth Haas, Gary MacGillivray
Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. Algorithms 11 (4) (2018)
Ruth Haas, Karen Seyffarth
Reconfiguring dominating sets in some well-covered and other classes of graphs. Discret. Math. 340 (8) (2017)
Julie Beier, Janet Fierson, Ruth Haas, Heather M. Russell, Kara Walcher Shavo
Classifying coloring graphs. Discret. Math. 339 (8) (2016)
sarah-marie belcastro, Ruth Haas
Triangle-free Uniquely 3-Edge Colorable Cubic Graphs. Contributions Discret. Math. 10 (2) (2015)
Ruth Haas, Karen Seyffarth
The k-Dominating Graph. Graphs Comb. 30 (3) (2014)
Sarah-Marie Belcastro, Ruth Haas
Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs. Discret. Math. 325 (2014)
Ruth Haas, Michael Young
The anti-Ramsey number of perfect matching. Discret. Math. 312 (5) (2012)
Ruth Haas
The canonical coloring graph of trees and cycles. Ars Math. Contemp. 5 (1) (2012)
Michael O. Albertson, Hannah Alpert, sarah-marie belcastro, Ruth Haas
Grünbaum colorings of toroidal triangulations. J. Graph Theory 63 (1) (2010)
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) (2005)
Ruth Haas, Thomas B. Wexler
Signed domination numbers of a graph and its complement. Discret. Math. 283 (1-3) (2004)
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)
Ruth Haas, Denis Hanson, Gary MacGillivray
Bounds For Partial List Colourings. Ars Comb. 67 (2003)
Ruth Haas, Thomas B. Wexler
Bounds on the signed domination number of a graph. Electron. Notes Discret. Math. 11 (2002)
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary MacGillivray
Star forests, dominating sets and Ramsey-type problems. Discret. Math. 245 (1-3) (2002)
Ruth Haas
Characterizations of arboricity of graphs. Ars Comb. 63 (2002)
Michael O. Albertson, Sara Grossman, Ruth Haas
Partial list colorings. Discret. Math. 214 (1-3) (2000)
Michael O. Albertson, Ruth Haas
The edge chromatic difference sequence of a cubic graph. Discret. Math. 177 (1-3) (1997)
Michael O. Albertson, Ruth Haas
Bounding Functions and Rigid Graphs. SIAM J. Discret. Math. 9 (2) (1996)
Michael O. Albertson, Ruth Haas
Parsimonious edge coloring. Discret. Math. 148 (1-3) (1996)
Michael O. Albertson, Lily Chan, Ruth Haas
Independence and graph homomorphisms graph homomorphisms. J. Graph Theory 17 (5) (1993)