English

Cycles through two edges in signed graphs

Combinatorics 2023-06-12 v1

Abstract

We give a characterization of when a signed graph GG with a pair of distinguished edges e1,e2E(G)e_1, e_2 \in E(G) has the property that all cycles containing both e1e_1 and e2e_2 have the same sign. This answers a question of Zaslavsky.

Keywords

Cite

@article{arxiv.2306.05574,
  title  = {Cycles through two edges in signed graphs},
  author = {Matt DeVos and Kathryn Nurse},
  journal= {arXiv preprint arXiv:2306.05574},
  year   = {2023}
}

Comments

11 pages, 1 figure

R2 v1 2026-06-28T11:00:35.003Z