# Finding a Path in Group-Labeled Graphs with Two Labels Forbidden

## Abstract

The parity of the length of paths and cycles is a classical and well-studied topic in graph theory and theoretical computer science. The parity constraints can be extended to the label constraints in a group-labeled graph, which is a directed graph with a group label on each arc. Recently, paths and cycles in group-labeled graphs have been investigated, such as finding non-zero disjoint paths and cycles.

In this paper, we present a solution to finding an \(s\)–\(t\) path in a group-labeled graph with two labels forbidden. This also leads to an elementary solution to finding a zero path in a \({\mathbb Z}_3\)-labeled graph, which is the first nontrivial case of finding a zero path. This situation in fact generalizes the 2-disjoint paths problem in undirected graphs, which also motivates us to consider that setting. More precisely, we provide a polynomial-time algorithm for testing whether there are at most two possible labels of \(s\)–\(t\) paths in a group-labeled graph or not, and finding \(s\)–\(t\) paths attaining at least three distinct labels if exist. We also give a necessary and sufficient condition for a group-labeled graph to have exactly two possible labels of \(s\)–\(t\) paths, and our algorithm is based on this characterization.

## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Arkin, E.M., Papadimitriou, C.H., Yannakakis, M.: Modularity of cycles and paths in graphs. Journal of the ACM
**38**, 255–274 (1991)zbMATHMathSciNetCrossRefGoogle Scholar - 2.Chudnovsky, M., Geelen, J., Gerards, B., Goddyn, L., Lohman, M., Seymour, P.D.: Packing non-zero
*A*-paths in group-labelled graphs. Combinatorica**26**, 521–532 (2006)zbMATHMathSciNetCrossRefGoogle Scholar - 3.Chudnovsky, M., Cunningham, W., Geelen, J.: An algorithm for packing non-zero
*A*-paths in group-labelled graphs. Combinatorica**28**, 145–161 (2008)zbMATHMathSciNetCrossRefGoogle Scholar - 4.Diestel, R.: Graph Theory, 4th edn. Springer-Verlag, Heidelberg (2010)CrossRefGoogle Scholar
- 5.Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science
**10**, 111–121 (1980)zbMATHMathSciNetCrossRefGoogle Scholar - 6.Hopcroft, J., Tarjan, R.: Efficient algorithm for graph manipulation. Communications of the ACM
**16**, 372–378 (1973)CrossRefGoogle Scholar - 7.Hopcroft, J., Tarjan, R.: Efficient planarity testing. Journal of the ACM
**21**, 549–568 (1974)zbMATHMathSciNetCrossRefGoogle Scholar - 8.Huynh, T.: The Linkage Problem for Group-Labelled Graphs, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Ontario (2009)Google Scholar
- 9.Kawarabayashi, K., Wollan, P.: Non-zero disjoint cycles in highly connected group labelled graphs. Journal of Combinatorial Theory, Ser. B
**96**, 296–301 (2006)zbMATHMathSciNetCrossRefGoogle Scholar - 10.Kawase, Y., Kobayashi, Y., Yamaguchi, Y.: Finding a path in group-labeled graphs with two labels forbidden (the full version is in preparation)Google Scholar
- 11.LaPaugh, A.S., Papadimitriou, C.H.: The even-path problem for graphs and digraphs. Networks
**14**, 507–513 (1984)zbMATHMathSciNetCrossRefGoogle Scholar - 12.McCuaig, W.: Pólya’s permanent problem. The Electronic Journal of Combinatorics
**11**, R79 (2004)MathSciNetGoogle Scholar - 13.Pólya, G.: Aufgabe 424. Arch. Math. Phys.
**20**, 271 (1913)Google Scholar - 14.Robertson, N., Seymour, P.D., Thomas, R.: Permanents, Pfaffian orientations, and even directed circuits. Annals of Mathematics
**150**, 929–975 (1999)zbMATHMathSciNetCrossRefGoogle Scholar - 15.Shiloach, Y.: A polynomial solution to the undirected two paths problem. Journal of the ACM
**27**, 445–456 (1980)zbMATHMathSciNetCrossRefGoogle Scholar - 16.Seymour, P.D.: Disjoint paths in graphs. Discrete Mathematics
**29**, 293–309 (1980)zbMATHMathSciNetCrossRefGoogle Scholar - 17.Thomassen, C.: 2-linked graphs. European Journal of Combinatorics
**1**, 371–378 (1980)zbMATHMathSciNetCrossRefGoogle Scholar - 18.Tanigawa, S., Yamaguchi, Y.: Packing non-zero
*A*-paths via matroid matching, Mathematical Engineering Technical Reports No. METR 2013–08, University of Tokyo (2013)Google Scholar - 19.Wollan, P.: Packing cycles with modularity constraint. Combinatorica
**31**, 95–126 (2011)zbMATHMathSciNetCrossRefGoogle Scholar - 20.Yamaguchi, Y.: Packing
*A*-paths in group-labelled graphs via linear matroid parity. In: Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 562–569 (2014)Google Scholar