Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics · 1989 · 12 citations · 2 references
Natural SciencesComputer ScienceMathematicsCombinatoricsGeometryTopologyGeometric GraphsGraph AlgorithmsGraph TheoryPolygon TriangulationTriangle GeometryTriangulation AlgorithmsTriangulation GraphsTriangulation Of Simple PolygonsTriangulations
Abstract Two 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.
2
The Complexity of Enumeration and Reliability Problems
Leslie G. Valiant · SIAM Journal on Computing · 1979 · 2.1K citations
G. M. Petersen, H. S. M. Coxeter · American Mathematical Monthly · 1961 · 548 citations