Edge coloring of products of signed graphs (2312.02691v3)
Abstract: In 2020, Behr defined the problem of edge coloring of signed graphs and showed that every signed graph $(G, \sigma)$ can be colored using exactly $\Delta(G)$ or $\Delta(G) + 1$ colors, where $\Delta(G)$ is the maximum degree in graph $G$. In this paper, we focus on products of signed graphs. We recall the definitions of the Cartesian, tensor, strong, and corona products of signed graphs and prove results for them. In particular, we show that $(1)$ the Cartesian product of $\Delta$-edge-colorable signed graphs is $\Delta$-edge-colorable, $(2)$ the tensor product of a $\Delta$-edge-colorable signed graph and a signed tree requires only $\Delta$ colors and $(3)$ the corona product of almost any two signed graphs is $\Delta$-edge-colorable. We also prove some results related to the coloring of products of signed paths and cycles.
- F. Harary, On the notion of balance of a signed graph, Michigan Mathematical Journal 2 (1953) 143–146. doi:10.1307/mmj/1028989917.
- F. Harary, On the coloring of signed graphs, Elemente der Mathematik 23 (1968) 85–89. doi:10.5169/seals-26032.
- T. Zaslavsky, Signed graph coloring, Discrete Mathematics 39 (1982) 215–228. doi:10.1016/0012-365X(82)90144-3.
- T. Zaslavsky, How colorful the signed graph?, Discrete Mathematics 52 (1984) 279–284. doi:10.1016/0012-365X(84)90088-8.
- T. Zaslavsky, Balanced decompositions of a signed graph, Journal of Combinatorial Theory, Series B 43 (1987) 1–13. doi:10.1016/0095-8956(87)90026-8.
- The chromatic number of a signed graph, The Electronic Journal of Combinatorics 23 (2016) P1–14. doi:10.37236/4938.
- F. Kardoš, J. Narboni, On the 4-color theorem for signed graphs, European Journal of Combinatorics 91 (2021) 103215. doi:10.1016/j.ejc.2020.103215.
- Y. Kang, E. Steffen, Circular coloring of signed graphs, Journal of Graph Theory 87 (2018) 135–148. doi:10.1002/jgt.22147.
- Choosability in signed planar graphs, European Journal of Combinatorics 52 (2016) 234–243. doi:10.1016/j.ejc.2015.10.001.
- T. Schweser, M. Stiebitz, Degree choosable signed graphs, Discrete Mathematics 340 (2017) 882–891. doi:10.1016/j.disc.2017.01.007.
- Y. Kang, E. Steffen, The chromatic spectrum of signed graphs, Discrete Mathematics 339 (2016) 2660–2663. doi:10.1016/j.disc.2016.05.013.
- Y. Kang, Hajós-like theorem for signed graphs, European Journal of Combinatorics 67 (2018) 199–207. doi:10.1016/j.ejc.2017.08.003.
- E. Steffen, A. Vogel, Concepts of signed graph coloring, European Journal of Combinatorics 91 (2021) 103226. doi:10.1016/j.ejc.2020.103226.
- R. Behr, Edge coloring signed graphs, Discrete Mathematics 343 (2020) 111654. doi:10.1016/j.disc.2019.111654.
- Edge coloring of graphs of signed class 1 and 2, Discrete Applied Mathematics 338 (2023) 311–319. doi:10.1016/j.dam.2023.06.029.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.