We give a characterization of when a signed graph GG with a pair of distinguished edges e1,e2∈E(G)e1,e2∈E(G) has the property that all cycles containing both e1e1 and e2e2 have the same sign. This answers a question of Zaslavsky.
生成讲解博客的中文版本
生成AI智能校验的中文版本