Cycles through two edges in signed graphs
Abstract
We give a characterization of when a signed graph G with a pair of distinguished edges e1, e2 ∈ E(G) has the property that all cycles containing both e1 and e2 have the same sign. This answers a question of Zaslavsky.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.