On Maximal Cycles or Triangular Planar Polygonal Graphs and Their Coloring

We analyze the cycles or planar polygonal graphs G which are maximal in their inner edges and offer a series of coloring results, such as chi(G)= 3 or P(G, 3) = 6, or construction algorithms, among others. Some aspects of them with various applications in path modeling, data flow design, computer networks or best resource allocation are discussed.

Automated summary

In this study, we analyze cycles or planar polygonal graphs G that are maximal in their inner edges and provide a series of coloring results, such as chi(G)= 3 or P(G, 3) = 6, as well as construction algorithms. Some aspects of these graphs with various applications in path modeling, data flow design, computer networks, or best resource allocation are discussed.