منابع مشابه
Coloring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given.
متن کاملHamiltonian Cycles on Random Eulerian Triangulations
A random Eulerian triangulation is a random triangulation where an even number of triangles meet at any given vertex. We argue that the central charge increases by one if the fully packed O(n) model is defined on a random Eulerian triangulation instead of an ordinary random triangulation. Considering the case n → 0, this implies that the system of random Eulerian triangulations equipped with Ha...
متن کاملColoring Eulerian Triangulations of the Klein Bottle
We show that an Eulerian triangulation of the Klein bottle has chromatic number equal to six if and only if it contains a complete graph of order six, and it is 5-colorable, otherwise. As a consequence of our proof, we derive that every Eulerian triangulation of the Klein bottle with facewidth at least four is 5-colorable.
متن کاملA new proof of 3-colorability of Eulerian triangulations
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short constructive proof of the theorem of Heawood that Eulerian triangulations are 3-colorable.
متن کاملConstellations and multicontinued fractions: application to Eulerian triangulations
We consider the problem of enumerating planar constellations with two points at a prescribed distance. Our approach relies on a combinatorial correspondence between this family of constellations and the simpler family of rooted constellations, which we may formulate algebraically in terms of multicontinued fractions and generalized Hankel determinants. As an application, we provide a combinator...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2002
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2074