Triangulation Graphs

Triangulation Graphs is a graph-theoretic construct that represents the decomposition of a polygon into triangles by non-crossing diagonals, where vertices correspond to polygon vertices and edges include both polygon sides and added diagonals that partition the polygonal region into triangular faces.

87

Publications

3K

Citations

177

Authors

123

Institutions

Publications per year

2017–2026

4

Authors

177

  1. MJ
    M. J. Grannell

    The Open University, United Kingdom

    3 publications · 105 citations

    3

    h-index

  2. CT
    Carsten Thomassen

    Technical University of Denmark, Denmark

    3 publications · 122 citations

    3

    h-index

  3. TS
    Terry S. Griggs

    The Open University, United Kingdom

    3 publications · 105 citations

    3

    h-index

  4. SN
    Seiya Negami

    Yokohama National University, Japan

    3 publications · 83 citations

    3

    h-index

  5. MA
    Manuel Abellanas

    Universidad Politécnica de Madrid, Spain

    2 publications · 62 citations

    2

    h-index

1–5 of 177

Venues

  1. Discrete Mathematics

    7 publications · 249 citations

    7

    h-index

  2. Journal of Graph Theory

    6 publications · 182 citations

    6

    h-index

  3. Discrete & Computational Geometry

    5 publications · 377 citations

    5

    h-index

  4. Journal of Combinatorial Theory Series B

    4 publications · 117 citations

    4

    h-index

  5. Journal of Combinatorial Theory Series A

    4 publications · 146 citations

    4

    h-index

1–5