Flip graphs of coloured triangulations of convex polygons
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other diagonal in the quadrilateral it defines. In this paper, we study...
Saved in:
| Date: | 2025 |
|---|---|
| Main Authors: | Baur, Karin, Bergerova, Diana, Voon, Jenni, Xu, Lejie |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2025
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2312 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
Colour class domination numbers of some classes of graphs
by: Venkatakrishnan, Yanamandram B., et al.
Published: (2018) -
Colour class domination numbers of some classes of graphs
by: Venkatakrishnan, Yanamandram B., et al.
Published: (2018) -
On colouring integers avoiding \(t\)-AP distance-sets
by: Ahmed, Tanbir
Published: (2016) -
On colouring integers avoiding \(t\)-AP distance-sets
by: Ahmed, Tanbir
Published: (2016) -
Bounds for graphs of given girth and generalized polygons
by: Benkherouf, Lakdere, et al.
Published: (2018)