On $2$-cycles of graphs
Serguei Norine, Robin Thomas, Hein van der Holst

TL;DR
This paper investigates the structure of 2-cycles in graphs, showing they can be decomposed into basic types, with special focus on Kuratowski-connected graphs and skew-symmetric cases, extending previous symmetric cycle results.
Contribution
It introduces a decomposition framework for 2-cycles into fundamental components, including new characterizations for Kuratowski-connected graphs and skew-symmetric 2-cycles.
Findings
Every 2-cycle decomposes into cycle-pair, Kuratowski, and quad 2-cycles.
In Kuratowski-connected graphs, 2-cycles are sums of cycle-pair and at most one Kuratowski 2-cycle.
Skew-symmetric 2-cycles decompose into skew-symmetric cycle-pair and quad 2-cycles.
Abstract
Let be a finite undirected graph. Orient the edges of in an arbitrary way. A -cycle on is a function such for each edge , and are circulations on , and whenever and have a common vertex. We show that each -cycle is a sum of three special types of -cycles: cycle-pair -cycles, Kuratowski -cycles, and quad -cycles. In case that the graph is Kuratowski connected, we show that each -cycle is a sum of cycle-pair -cycles and at most one Kuratowski -cycle. Furthermore, if is Kuratowski connected, we characterize when every Kuratowski -cycle is a sum of cycle-pair -cycles. A -cycles on is skew-symmetric if for all edges . We show that each -cycle is a sum of two special types of skew-symmetric -cycles: skew-symmetric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph Labeling and Dimension Problems
