Ruth Haas

30 papers Journal 29Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Well-Forced Graphs.
Graphs Comb.
Cheryl Grood, Ruth Haas, Bonnie C. Jacob, Erika L. C. King, Shahla Nasserasr
2023 J jnl
Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters.
Graphs Comb.
Novi H. Bong, Joshua Carlson, Bryan Curtis, Ruth Haas, Leslie Hogben
2023 J jnl
Reconfiguration graphs of zero forcing sets.
Discret. Appl. Math.
Jesse Geneson, Ruth Haas, Leslie Hogben
2022 J jnl
Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph.
INFORMS J. Comput.
Illya V. Hicks, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David E. Roberson, Logan A. Smith
2022 J jnl
Grünbaum colorings extended to non-facial 3-cycles.
Electron. J. Graph Theory Appl.
sarah-marie belcastro, Ruth Haas
2022 J jnl
Hamilton Paths in Dominating Graphs of Trees and Cycles.
Graphs Comb.
Kira V. Adaricheva, Heather C. Smith Blake, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Karen Seyffarth
2021 J jnl
Color-induced subgraphs of Grünbaum colorings of triangulations.
Australas. J Comb.
sarah-marie belcastro, Ruth Haas
2020 J jnl
Reconfiguration graphs of zero forcing sets.
CoRR
Jesse Geneson, Ruth Haas, Leslie Hogben
2018 J jnl
Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs.
Algorithms
Ruth Haas, Gary MacGillivray
2018 J jnl
Reconfiguration graphs of shortest paths.
Discret. Math.
John Asplund, Kossi D. Edoh, Ruth Haas, Yulia Hristova, Beth Novick, Brett Werner
2017 J jnl
Reconfiguring dominating sets in some well-covered and other classes of graphs.
Discret. Math.
Ruth Haas, Karen Seyffarth
2016 J jnl
Classifying coloring graphs.
Discret. Math.
Julie Beier, Janet Fierson, Ruth Haas, Heather M. Russell, Kara Walcher Shavo
2015 J jnl
Triangle-free Uniquely 3-Edge Colorable Cubic Graphs.
Contributions Discret. Math.
sarah-marie belcastro, Ruth Haas
2014 J jnl
Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs.
Discret. Math.
sarah-marie belcastro, Ruth Haas
2014 J jnl
The k-Dominating Graph.
Graphs Comb.
Ruth Haas, Karen Seyffarth
2012 J jnl
The anti-Ramsey number of perfect matching.
Discret. Math.
Ruth Haas, Michael Young
2012 J jnl
The canonical coloring graph of trees and cycles.
Ars Math. Contemp.
Ruth Haas
2010 J jnl
Grünbaum colorings of toroidal triangulations.
J. Graph Theory
Michael O. Albertson, Hannah Alpert, sarah-marie belcastro, Ruth Haas
2005 J jnl
Planar minimally rigid graphs and pseudo-triangulations.
Comput. Geom.
Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
2004 J jnl
Signed domination numbers of a graph and its complement.
Discret. Math.
Ruth Haas, Thomas B. Wexler
2003 J jnl
Bounds For Partial List Colourings.
Ars Comb.
Ruth Haas, Denis Hanson, Gary MacGillivray
2003 — conf
Planar minimally rigid graphs and pseudo-triangulations.
SCG
Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
2002 J jnl
Bounds on the signed domination number of a graph.
Electron. Notes Discret. Math.
Ruth Haas, Thomas B. Wexler
2002 J jnl
Characterizations of arboricity of graphs.
Ars Comb.
Ruth Haas
2002 J jnl
Star forests, dominating sets and Ramsey-type problems.
Discret. Math.
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary MacGillivray
2000 J jnl
Partial list colorings.
Discret. Math.
Michael O. Albertson, Sara Grossman, Ruth Haas
1997 J jnl
The edge chromatic difference sequence of a cubic graph.
Discret. Math.
Michael O. Albertson, Ruth Haas
1996 J jnl
Bounding Functions and Rigid Graphs.
SIAM J. Discret. Math.
Michael O. Albertson, Ruth Haas
1996 J jnl
Parsimonious edge coloring.
Discret. Math.
Michael O. Albertson, Ruth Haas
1993 J jnl
Independence and graph homomorphisms graph homomorphisms.
J. Graph Theory
Michael O. Albertson, Lily Chan, Ruth Haas