Abstract
We present an improved upper bound of \(O(d^{1+\frac{1}{m-1}})\) for the \((2,\mathcal{F})\)-subgraph chromatic number \(\chi_{2,\mathcal{F}}(G)\) of any graph G of maximum degree d. Here, m denotes the minimum number of edges in any member of \(\mathcal{F}\). This bound is tight up to a (logd)1/(m − 1) multiplicative factor and improves the previous bound presented in [1].
We also obtain a relationship connecting the oriented chromatic number χ o (G) of graphs and the \((j,\mathcal{F})\)-subgraph chromatic numbers \(\chi_{j,\mathcal{F}}(G)\) introduced and studied in [1]. In particular, we relate oriented chromatic number and the (2,r)-treewidth chromatic number and show that \(\chi_o(G) \leq k\left((r+1)2^r\right)^{k-1}\) for any graph G having (2,r)-treewidth chromatic number at most k. The latter parameter is the least number of colors in any proper vertex coloring which is such that the subgraph induced by the union of any two color classes has treewidth at most r.
We also generalize a result of Alon, et. al. [2] on acyclic chromatic number of graphs on surfaces to \((2,\mathcal{F})\)-subgraph chromatic numbers and prove that \(\chi_{2,\mathcal{F}}(G) = O(\gamma^{m/(2m-1)})\) for some constant m depending only on \(\mathcal{F}\). We also show that this bound is nearly tight. We then use this result to show that graphs of genus g have oriented chromatic number at most \(2^{O(g^{1/2 + \epsilon})}\) for every fixed ε> 0. This improves the previously known bound of \(2^{O(g^{4/7})}\). We also refine the proof of a bound on χ o (G) obtained by Kostochka, et. al. in [3] to obtain an improved bound on χ o (G).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aravind, N.R., Subramanian, C.R.: Bounds on proper colorings with restrictions on the union of color classes. Submitted to a Journal
Alon, N., Mohar, B., Sanders, D.P.: On acyclic colorings of graphs on surfaces. Israel Journal of Mathematics 94, 273–283 (1996)
Kostochka, A.V., Sopena, E., Zhu, X.: Acyclic and oriented chromatic numbers of graphs. Journal of Graph Theory 24(4), 331–340 (1997)
Grünbaum, B.: Acyclic colorings of planar graphs. Israel Journal of Mathematics 14, 390–408 (1973)
Albertson, M.O., Berman, D.M.: The acyclic chromatic number. Congr. Numer. 17, 51–60 (1976)
Sopena, E.: The chromatic number of oriented graphs. Journal of Graph Theory 25(2), 191–205 (1997)
Raspaud, A., Sopena, E.: Good and semi-strong colorings of oriented planar graphs. Inf. Process. Lett. 51(4), 171–174 (1994)
Nesetril, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6), 1022–1041 (2006)
Alon, N., McDiarmid, C., Reed, B.: Acyclic coloring of graphs. Random Struct. Algorithms 2(3), 277–288 (1991)
Ringel, G., Youngs, J.W.T.: Solution of the heawood map coloring problem. Proc. Nat. Acd. Sci. U.S.A. 60, 438–445 (1968)
Borodin, O.V.: Acyclic colorings of planar graphs. Discrete Mathematics 25(3), 211–236 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aravind, N.R., Subramanian, C.R. (2009). Forbidden Subgraph Colorings and the Oriented Chromatic Number. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-10217-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10216-5
Online ISBN: 978-3-642-10217-2
eBook Packages: Computer ScienceComputer Science (R0)