Signed graphs with the same even cycles

IF 1 2区数学 Q1 MATHEMATICS

Combinatorica Pub Date : 2025-07-04 DOI:10.1007/s00493-025-00160-4

Bertrand Guenin, Cheolwon Heo, Irene Pivotto

引用次数: 0

Abstract

Whitney proved that if two 3-connected graphs G and $G'$ have the same set of cycles (or equivalently, the same set of cuts) then $G=G'$ . We characterize when two 4-connected signed graphs have the same set of even cycles, and we characterize when two 4-connected grafts have the same set of even cuts.

查看原文本刊更多论文

具有相同偶数环的符号图

Whitney证明了如果两个3连通图G和G‘ G’具有相同的环集（或等价地，相同的切集），则G=G‘ G=G’。我们刻画了两个4连通符号图有相同的偶环集，以及两个4连通接枝有相同的偶切集。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Combinatorica 数学-数学

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are - Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups). - Combinatorial optimization. - Combinatorial aspects of geometry and number theory. - Algorithms in combinatorics and related fields. - Computational complexity theory. - Randomization and explicit construction in combinatorics and algorithms.