Taiwanese Journal of Mathematics

Injective Chromatic Number of Outerplanar Graphs

Mahsa Mozafari-Nia and Behnaz Omoomi

Full-text: Open access

Abstract

An injective coloring of a graph is a vertex coloring where two vertices with common neighbor receive distinct colors. The minimum integer $k$ such that $G$ has a $k$-injective coloring is called injective chromatic number of $G$ and denoted by $\chi_i(G)$. In this paper, the injective chromatic number of outerplanar graphs with maximum degree $\Delta$ and girth $g$ is studied. It is shown that every outerplanar graph $G$ has $\chi_i(G) \leq \Delta+2$, and this bound is tight. Then, it is proved that for an outerplanar graph $G$ with $\Delta = 3$, $\chi_i(G) \leq \Delta+1$ and the bound is tight for outerplanar graphs of girth $3$ and $4$. Finally, it is proved that, the injective chromatic number of $2$-connected outerplanar graphs with $\Delta = 3$, $g \geq 6$ and $\Delta \geq 4$, $g \geq 4$ is equal to $\Delta$.

Article information

Source
Taiwanese J. Math., Volume 22, Number 6 (2018), 1309-1320.

Dates
Received: 30 September 2017
Revised: 3 April 2018
Accepted: 13 August 2018
First available in Project Euclid: 20 August 2018

Permanent link to this document
https://projecteuclid.org/euclid.twjm/1534730418

Digital Object Identifier
doi:10.11650/tjm/180807

Mathematical Reviews number (MathSciNet)
MR3880234

Zentralblatt MATH identifier
07021691

Subjects
Primary: 05C15: Coloring of graphs and hypergraphs

Keywords
injective coloring injective chromatic number outerplanar graph

Citation

Mozafari-Nia, Mahsa; Omoomi, Behnaz. Injective Chromatic Number of Outerplanar Graphs. Taiwanese J. Math. 22 (2018), no. 6, 1309--1320. doi:10.11650/tjm/180807. https://projecteuclid.org/euclid.twjm/1534730418


Export citation

References

  • O. V. Borodin, Colorings of plane graphs: A survey, Discrete Math. 313 (2013), no. 4, 517–539.
  • O. V. Borodin and A. O. Ivanova, Injective $(\Delta+1)$-coloring of planar graphs with girth 6, Sib. Math. J. 52 (2011), no. 1, 23–29.
  • Y. Bu, D. Chen, A. Raspaud and W. Wang, Injective coloring of planar graphs, Discrete Appl. Math. 157 (2009), no. 4, 663–672.
  • Y. Bu and K. Lu, Injective coloring of planar graphs with girth 7, Discrete Math. Algorithms Appl. 4 (2012), no. 2, 1250034, 8 pp.
  • W. Dong and W. Lin, Injective coloring of planar graphs with girth 6, Discrete Math. 313 (2013), no. 12, 1302–1311.
  • ––––, Injective coloring of plane graphs with girth 5, Discrete Math. 315 (2014), 120–127.
  • G. Hahn, J. Kratochvíl, J. Širáň and D. Sotteau, On the injective chromatic number of graphs, Discrete Math. 256 (2002), no. 1-2, 179–192.
  • K.-W. Lih and W.-F. Wang, Coloring the square of an outerplanar graph, Taiwanese J. Math. 10 (2006), no. 4, 1015–1023.
  • B. Lužar, Note on planar graphs with largest injective chromatic numbers.
  • B. Lužar and R. Škrekovski, Counterexamples to a conjecture on injective colorings, Ars Math. Contemp. 8 (2015), no. 2, 291–295.
  • B. Lužar, R. Škrekovski and M. Tancer, Injective colorings of planar graphs with few colors, Discrete Math. 309 (2009), no. 18, 5636–5649.
  • V. G. Vizing, Coloring the vertices of a graph in prescribed colors, Diskret. Analiz No. 29 Metody Diskret. Anal. v Teorii Kodov i Shem (1976), 3–10, 101.
  • G. Wegner, Graphs with Given Diameter and a Coloring Problem, Technical report, University of Dortmund, Dortmund, 1977.