Advanced search
Publication Cover
AKCE International Journal of Graphs and Combinatorics Volume 19, 2022 - Issue 3
Submit an article Journal homepage
926
Views
0
CrossRef citations to date
0
Altmetric
Articles

Exact square coloring of graphs resulting from some graph operations and products

PriyamvadaDepartment of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, IndiaCorrespondence[email protected]
View further author information
&
B. S. PandaDepartment of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, IndiaView further author information
Pages 211-220 | Received 06 Apr 2022, Accepted 18 Jun 2022, Published online: 15 Jul 2022

References

  • Brešar, B., Gastineau, N., Klavžar, S., Togni, O. (2019). Exact distance graphs of product graphs. Graphs Combin. 35(6): 1555–1569.
  • Calamoneri, T., Sinaimeri, B. (2013). L (2, 1)-labeling of oriented planar graphs. Discrete Appl. Math. 161(12): 1719–1725.
  • Chang, F.-H., Chia, M.-L., Jiang, S.-A., Kuo, D., Liaw, S.-C. (2021). L (p, q)-labelings of subdivisions of graphs. Discrete Appl. Math. 291: 264–270.
  • Chen, Y.-T., Chia, M.-L., Kuo, D. (2009). L (p, q)-labeling of digraphs. Discrete Appl. Math. 157(8): 1750–1759.
  • Dong, W. (2020). L (p, q)-labeling of planar graphs with small girth. Discrete Appl. Math. 284: 592–601.
  • Foucaud, F., Hocquard, H., Mishra, S., Narayanan, N., Naserasr, R., Sopena, E, Valicov, P. (2021). Exact square coloring of subcubic planar graphs. Discrete Appl. Math. 293: 74–89.
  • Kramer, F., Kramer, H. (1969a). Ein färbungsproblem der knotenpunkte eines graphen bezüglich der distanz p. Rev. Roumaine Math. Pures Appl. 14(2): 1031–1038.
  • Kramer, F., Kramer, H. (1969b). Un probleme de coloration des sommets d’un graphe. CR Acad. Sci. Paris A 268(7): 46–48.
  • Lam, P. C. B., Lin, W., Wu, J. (2007). L(j, k)-labellings and circular L(j, k)-labellings of products of complete graphs. J. Comb. Optim. 14(2-3): 219–227.
  • Liu, L., Wu, Q. (2020). L (1, 2)-labeling numbers on square of cycles. AKCE Int. J. Graphs Combin. 17(3): 915–919.
  • Lü, D., Lin, N. (2013). L(2, 1)-labelings of the edge-path-replacement of a graph. J. Comb. Optim. 26: 385–392.
  • Panda, B. S., Priyamvada (2021). Injective coloring of some subclasses of bipartite graphs and chordal graphs. Discrete Appl. Math. 291: 68–87.
  • Panda, B. S., Priyamvada (2022). Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs. Theor. Comput. Sci. 906: 32–51.
  • Panda, B. S., Goel, P. (2011). L(2,1)-labeling of perfect elimination bipartite graphs. Discrete Appl. Math. 159(16): 1878–1888.
  • Paul, S., Pal, M., Pal, A. (2013). An efficient algorithm to solve l (0, 1)-labelling problem on interval graphs. Adv. Model. Optim. 15(1): 31–43.
  • Priyamvada, Panda, B. S. (2022). Exact square coloring of graphs resulting from some graph operations and products. International Conference on Graphs, Combintorics and Optimization (ICGCO), BITS Pilani, Dubai Campus.
  • Sen, S. (2014). L (2, 1)-Labelings of some families of oriented planar graphs. Discuss. Math. Graph Theory 34(1): 31–48.
  • Shalu, M. A., Vijayakumar, S., Yamini, S. D., Sandhya, T. P. (2018). On the algorithmic aspects of strong subcoloring. J. Comb. Optim. 35(4): 1312–1329.
  • Shao, Z., Jiang, H., Vesel, A. (2018). L (2, 1)-labeling of the Cartesian and strong product of two directed cycles. Math. Found. Comput. 1(1): 49–61.
  • Wu, Q., Shiu, W. C. (2017). L(j, k)-labeling numbers of square of paths. AKCE Int. J. Graphs Combin. 14(3): 307–316.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.