Cobiased graphs: Single-element extensions and elementary quotients of graphic matroids
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913216705069056 |
|---|---|
| author | Slilaty, Daniel Zaslavsky, Thomas |
| author_facet | Slilaty, Daniel Zaslavsky, Thomas |
| contents | 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, dual graphical structure that we call a cobiased graph and use it to characterize single-element extensions and elementary quotients of graphic matroids. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_17616 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cobiased graphs: Single-element extensions and elementary quotients of graphic matroids Slilaty, Daniel Zaslavsky, Thomas Combinatorics 05B35 (Primary) 05C22 (Secondary) 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, dual graphical structure that we call a cobiased graph and use it to characterize single-element extensions and elementary quotients of graphic matroids. |
| title | Cobiased graphs: Single-element extensions and elementary quotients of graphic matroids |
| topic | Combinatorics 05B35 (Primary) 05C22 (Secondary) |
| url | https://arxiv.org/abs/2401.17616 |