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 n...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Mathematics and Theoretical Computer Science Vol. 11 no. 2; no. Graph and Algorithms; pp. 47 - 56
Main Authors Fabila-Monroy, Ruy, Flores-Peñaloza, David, Huemer, Clemens, Hurtado, Ferran, Urrutia, Jorge, Wood, David R.
Format Journal Article
LanguageEnglish
Published Nancy DMTCS 01.01.2009
Discrete Mathematics & Theoretical Computer Science
Subjects
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Computer Science
Discrete Mathematics
Graphic methods
Hamiltonian function
Number theory
Australia
Mexico
Spain
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.460