Volterra type integral equation method for the radial Schrödinger equation: Single channel case

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 Δ + 2 colors, where Δ is the maximum degree of a graph. Guiduli disproved the conjecture. However, Shiu et al. considered graphs with Δ = 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 Δ + 1 colors.