AbstractTwo graphs, the edge crossing graph E and the triangle graph T are associated with a simple lattice polygon. The maximal independent sets of vertices of E and T are derived including a formula for the size of the fundamental triangles. Properties of E and T are derived including a formula for the size of the maximal independent sets in E and T. It is shown that T is a factor graph of edge-disjoint 4-cycles, which gives corresponding geometric information, and is a partition graph as recently defined by the authors and F. Harary.
Read full abstract