Cobiased Graphs: Single-Element Extensions and Elementary Quotients of Graphic Matroids
-
Published:2024-03-08
Issue:1
Volume:31
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Slilaty Daniel,Zaslavsky Thomas
Abstract
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.
Publisher
The Electronic Journal of Combinatorics