Abstract:We present a deterministic linear-time algorithm for finding an odd/even cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at most $2$. For a given $\Gamma$-labeled graph with two specified vertices (or edges), we can determine in linear time whether there exist two cycles with distinct labels that are through both of the two specified vertices (or edges), and find such cycles if yes.
From: Yutaro Yamaguchi [view email]
[v1]
Sat, 25 Apr 2026 06:48:33 UTC (46 KB)
[v2]
Mon, 10 Aug 2026 01:13:56 UTC (48 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。