Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cycles through two edges in signed graphs

Published 8 Jun 2023 in math.CO | (2306.05574v1)

Abstract: We give a characterization of when a signed graph GG with a pair of distinguished edges e1,e2∈E(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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.