Discrete Mathematics
Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
Incidence and strong edge colorings of graphs
Discrete Mathematics
On incidence coloring and star arboricity of graphs
Discrete Mathematics
Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The incidence game chromatic number
Discrete Applied Mathematics
The incidence game chromatic number of paths and subgraphs of wheels
Discrete Applied Mathematics
| Hi-index | 0.09 |
Brualdi and Massey defined the incidence coloring number of a graph and bounded itby the maximum degree. They conjectured that every graph can be incidence colored with @D + 2 colors, where @D is the maximum degree of a graph. Guiduli disproved the conjecture. However, Shiu et al. considered graphs with @D = 3 and showed that the conjecture holds for cubic Hamiltonian graphs and some other cubic graphs. This work presents methods of incidence coloring of square meshes, hexagonal meshes, and honeycomb meshes. The meshes can be incidence colored with @D + 1 colors.