Abstract
Zaslavsky (1991) characterized all single-element coextensions of graphic matroids in terms of a graphical structure called a biased graph. In this paper we characterize all orientations of a single-element coextension of a graphic matroid in terms of graphically defined orientations of its associated biased graph.
| Original language | American English |
|---|---|
| Pages (from-to) | 61-69 |
| Number of pages | 9 |
| Journal | Open Journal of Discrete Applied Mathematics |
| Volume | 8 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jul 27 2025 |
Keywords
- Biased graph
- Matroid
- Oriented matroids
- Orientation
- Lift matroid
- Single-element coextension
Disciplines
- Mathematics
Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS