26 citations · 38 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DM2013★ 8 cited
Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms
Marc Hellmuth, Manuel Noll, Lydia Ostermeier
It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time.…
cs.DM2013★ 4 cited
Square Property, Equitable Partitions, and Product-like Graphs
Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler
Equivalence relations on the edge set of a graph that satisfy restrictive conditions on chordless squares play a crucial role in the theory of Cartesian graph products and grap…