1 citations · 2 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024
Weakly Negative Circles Versus Best Clustering in Signed Graphs
Michael G. Gottstein, Leila Parsaei-Majd, Thomas Zaslavsky
Clustering a signed graph means partitioning the vertices into sets ("clusters") so that every positive edge, and no negative edge, is within a cluster. Clustering is not always po…
math.CO2024★ 1 cited
Cobiased graphs: Single-element extensions and elementary quotients of graphic matroids
Daniel Slilaty, Thomas Zaslavsky
Zaslavsky (1991) introduced a graphical structure called a biased graph and used it to characterize all single-element coextensions and elementary lifts of graphic matroids. We int…