Answers are grounded in this paper and cite their sources.
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 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.
No takes yet. Share an insight, caveat, or question.
Slilaty et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: