Cobiased graphs: single-element extensions and elementary quotients of graphic matroids (Q6194253)

Summary: \textit{T. Zaslavsky} [J. Comb. Theory, Ser. B 51, No. 1, 46--72 (1991; Zbl 0763.05096)] introduced a graphical structure called a biased graph and used it to characterize all single-element coextensions and elementary lifts of graphic matroids. We introduce a new graphical structure that we call a cobiased graph and use it to characterize single-element extensions and elementary quotients of graphic matroids.