Have a personal or library account? Click to login
On L′ (2, 1)–Edge Coloring Number of Regular Grids Cover

Abstract

In this paper, we study multi-level distance edge labeling for infinite rectangular, hexagonal and triangular grids. We label the edges with non-negative integers. If the edges are adjacent, then their color difference is at least 2 and if they are separated by exactly a single edge, then their colors must be distinct. We find the edge coloring number of these grids to be 9, 7 and 16, respectively so that we could color the edges of a rectangular, hexagonal and triangular grid with at most 10, 8 and 17 colors, respectively using this coloring technique. Repeating the sequence pattern for different grids, we can color the edges of a grid of larger size.

DOI: https://doi.org/10.2478/auom-2019-0034 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Language: English
Page range: 65 - 81
Submitted on: Dec 10, 2018
|
Accepted on: Jan 31, 2019
|
Published on: Dec 21, 2019
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2019 D. Deepthy, Joseph Varghese Kureethara, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.