Independence and graph homomorphisms graph homomorphisms. - Michael O. Albertson; Lily Chan; Ruth Haas (J. Graph Theory, 1993)

Parsimonious edge coloring. - Michael O. Albertson; Ruth Haas (Discret. Math., 1996)

Bounding Functions and Rigid Graphs. - Michael O. Albertson; Ruth Haas (SIAM J. Discret. Math., 1996)

The edge chromatic difference sequence of a cubic graph. - Michael O. Albertson; Ruth Haas (Discret. Math., 1997)

Partial list colorings. - Michael O. Albertson; Sara Grossman; Ruth Haas (Discret. Math., 2000)

Characterizations of arboricity of graphs. - Ruth Haas (Ars Comb., 2002)

Star forests, dominating sets and Ramsey-type problems. - Sheila Ferneyhough; Ruth Haas; Denis Hanson; Gary MacGillivray (Discret. Math., 2002)

Bounds on the signed domination number of a graph. - Ruth Haas; Thomas B. Wexler (Electron. Notes Discret. Math., 2002)

Bounds For Partial List Colourings. - Ruth Haas; Denis Hanson; Gary MacGillivray (Ars Comb., 2003)

Signed domination numbers of a graph and its complement. - Ruth Haas; Thomas B. Wexler (Discret. Math., 2004)

Planar minimally rigid graphs and pseudo-triangulations. - Ruth Haas; David Orden; Günter Rote; Francisco Santos; Brigitte Servatius; Herman Servatius; Diane L. Souvaine; Ileana Streinu; Walter Whiteley (Comput. Geom., 2005)

Grünbaum colorings of toroidal triangulations. - Michael O. Albertson; Hannah Alpert; sarah-marie belcastro; Ruth Haas (J. Graph Theory, 2010)

The canonical coloring graph of trees and cycles. - Ruth Haas (Ars Math. Contemp., 2012)

The anti-Ramsey number of perfect matching. - Ruth Haas; Michael Young (Discret. Math., 2012)

Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs. - Sarah-Marie Belcastro; Ruth Haas (Discret. Math., 2014)

The k-Dominating Graph. - Ruth Haas; Karen Seyffarth (Graphs Comb., 2014)

Triangle-free Uniquely 3-Edge Colorable Cubic Graphs. - sarah-marie belcastro; Ruth Haas (Contributions Discret. Math., 2015)

Classifying coloring graphs. - Julie Beier; Janet Fierson; Ruth Haas; Heather M. Russell; Kara Walcher Shavo (Discret. Math., 2016)

Reconfiguring dominating sets in some well-covered and other classes of graphs. - Ruth Haas; Karen Seyffarth (Discret. Math., 2017)

Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. - Ruth Haas; Gary MacGillivray (Algorithms, 2018)

Reconfiguration graphs of shortest paths. - John Asplund; Kossi D. Edoh; Ruth Haas; Yulia Hristova; Beth Novick; Brett Werner (Discret. Math., 2018)

Color-induced subgraphs of Grünbaum colorings of triangulations. - sarah-marie belcastro; Ruth Haas (Australas. J Comb., 2021)

Grünbaum colorings extended to non-facial 3-cycles. - sarah-marie belcastro; Ruth Haas (Electron. J. Graph Theory Appl., 2022)

Hamilton Paths in Dominating Graphs of Trees and Cycles. - Kira V. Adaricheva; Heather C. Smith Blake; Chassidy Bozeman; Nancy E. Clarke; Ruth Haas; Margaret-Ellen Messinger; Karen Seyffarth (Graphs Comb., 2022)

Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph. - Illya V. Hicks; Boris Brimkov; Louis Deaett; Ruth Haas; Derek Mikesell; David E. Roberson; Logan A. Smith (INFORMS J. Comput., 2022)

Reconfiguration graphs of zero forcing sets. - Jesse Geneson; Ruth Haas; Leslie Hogben (Discret. Appl. Math., 2023)

Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters. - Novi H. Bong; Joshua Carlson; Bryan Curtis; Ruth Haas; Leslie Hogben (Graphs Comb., 2023)

Well-Forced Graphs. - Cheryl Grood; Ruth Haas; Bonnie C. Jacob; Erika L. C. King; Shahla Nasserasr (Graphs Comb., 2024)