Graphs associated with triangulations of lattice polygons
1989 ◽
Vol 47
(3)
◽
pp. 391-398
◽
Keyword(s):
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.
2020 ◽
Vol 30
(1)
◽
pp. 53-67
◽
2009 ◽
Vol 109
(4)
◽
pp. 248-253
◽
1983 ◽
Vol 9
(4)
◽
pp. 583-589
◽
2017 ◽
Vol 340
(12)
◽
pp. 2762-2768
◽
2021 ◽
Vol 77
(6)
◽
1998 ◽
Vol 11
(4)
◽
pp. 644-654
◽
2011 ◽
Vol 311
(13)
◽
pp. 1158-1163
◽
1999 ◽
Vol 70
(4)
◽
pp. 587-599
◽