1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
math.CO2010
Perpendicular dissections of space
Thomas Zaslavsky
For each pair of reference points and each real number there is a unique hyperplane such that for points in .…
math.CO2010
An elementary chromatic reduction for gain graphs and special hyperplane arrangements
Pascal Berthome, Raul Cordovil, David Forge +2
A gain graph is a graph whose edges are labelled invertibly by "gains" from a group. "Switching" is a transformation of gain graphs that generalizes conjugation in a group. A "weak…