Abstract
An (m, n)-colored mixed graph G is a graph with its arcs having one of the m different colors and edges having one of the n different colors. A homomorphism f of an (m, n)-colored mixed graph G to an (m, n)-colored mixed graph H is a vertex mapping such that if uv is an arc (edge) of color c in G, then f(u)f(v) is an arc (edge) of color c in H. The \((\textit{m,n})\) -colored mixed chromatic number \(\chi _{(m,n)}(G)\) of an (m, n)-colored mixed graph G is the order (number of vertices) of a smallest homomorphic image of G. This notion was introduced by Nešetřil and Raspaud (2000, J. Combin. Theory, Ser. B 80, 147–155). They showed that \(\chi _{(m,n)}(G) \le k(2m+n)^{k-1}\) where G is a acyclic k-colorable graph. We prove the tightness of this bound. We also show that the acyclic chromatic number of a graph is bounded by \(k^2 + k^{2 + \lceil \log _{(2m+n)} \log _{(2m+n)} k \rceil }\) if its (m, n)-colored mixed chromatic number is at most k. Furthermore, using probabilistic method, we show that for connected graphs with maximum degree \(\varDelta \) its (m, n)-colored mixed chromatic number is at most \(2(\varDelta -1)^{2m+n} (2m+n)^{\varDelta -\min (2m+n, 3)+2}\). In particular, the last result directly improves the upper bound \(2\varDelta ^2 2^{\varDelta }\) of oriented chromatic number of graphs with maximum degree \(\varDelta \), obtained by Kostochka et al. (1997, J. Graph Theory 24, 331–340) to \(2(\varDelta -1)^2 2^{\varDelta }\). We also show that there exists a connected graph with maximum degree \(\varDelta \) and (m, n)-colored mixed chromatic number at least \((2m+n)^{\varDelta /2}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alon, N., Marshall, T.H.: Homomorphisms of edge-colored graphs and Coxeter groups. J. Algebr. Combin. 8(1), 5–13 (1998)
Borodin, O.V.: On acyclic colorings of planar graphs. Discret. Math. 25(3), 211–236 (1979)
Duffy, C.: Homomorphisms of \((j, k)\)-mixed graphs. Ph.D. thesis, University of Victoria/University of Bordeaux (2015)
Kostochka, A.V., Sopena, É., Zhu, X.: Acyclic and oriented chromatic numbers of graphs. J. Graph Theory 24, 331–340 (1997)
St, C., Nash-Williams, J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 1(1), 12–12 (1964)
Nešetřil, J., Raspaud, A.: Colored homomorphisms of colored mixed graphs. J. Combin. Theory Ser. B 80(1), 147–155 (2000)
Ochem, P.: Negative results on acyclic improper colorings. In: European Conference on Combinatorics (EuroComb 2005), pp. 357–362 (2005)
Raspaud, A., Sopena, É.: Good and semi-strong colorings of oriented planar graphs. Inf. Process. Lett. 51(4), 171–174 (1994)
Sopena, É.: Homomorphisms and colourings of oriented graphs: an updated survey. Discret. Math. 339(7), 1993–2005 (2016)
Acknowledgement
The authors would like to thank the anonymous reviewer for the constructive comments towards improvement of the content, clarity and conciseness of the manuscript.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Das, S., Nandi, S., Sen, S. (2017). On Chromatic Number of Colored Mixed Graphs. In: Gaur, D., Narayanaswamy, N. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2017. Lecture Notes in Computer Science(), vol 10156. Springer, Cham. https://doi.org/10.1007/978-3-319-53007-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-53007-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53006-2
Online ISBN: 978-3-319-53007-9
eBook Packages: Computer ScienceComputer Science (R0)