92 citations · 103 across the 9 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
math.CO2012
Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
sarah-marie belcastro, Ruth Haas
Two edge colorings of a graph are {\em edge-Kempe equivalent} if one can be obtained from the other by a series of edge-Kempe switches. This work gives some results for the number…
math.CO2012★ 2 cited
The -Dominating Graph
Ruth Haas, Karen Seyffarth
Given a graph , the -dominating graph of , , is defined to be the graph whose vertices correspond to the dominating sets of that have cardinality at most .…