10.46298/dmtcs.460
https://dmtcs.episciences.org/460
Fabila-Monroy, Ruy
Ruy
Fabila-Monroy
Flores-Peñaloza, David
David
Flores-Peñaloza
Huemer, Clemens
Clemens
Huemer
Hurtado, Ferran
Ferran
Hurtado
Urrutia, Jorge
Jorge
Urrutia
Wood, David R.
David R.
Wood
0000-0001-8866-3041
On the chromatic number of some flip graphs
Graphs and Algorithms
This paper studies the chromatic number of the following four flip graphs (under suitable definitions of a flip): the flip graph of perfect matchings of a complete graph of even order, the flip graph of triangulations of a convex polygon (the associahedron), the flip graph of non-crossing Hamiltonian paths of a set of points in convex position, and the flip graph of triangles in a convex point set. We give tight bounds for the latter two cases and upper bounds for the first two.
episciences.org
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
2009-01-01
2009-01-01
en
journal article
https://hal.science/hal-00988210v1
1365-8050
https://dmtcs.episciences.org/460/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 11 no. 2
Graph and Algorithms
Researchers
Students