arXiv Analytics

Sign in

arXiv:1207.1882 [math.CO]AbstractReferencesReviewsResources

Realizing the chromatic numbers and orders of spinal quadrangulations of surfaces

Serge Lawrencenko

Published 2012-07-08, updated 2013-12-18Version 2

A method is suggested for construction of quadrangulations of the closed orientable surface with given genus g and either (1) with given chromatic number or (2) with given order allowed by the genus g. In particular, N. Hartsfield and G. Ringel's results [Minimal quadrangulations of orientable surfaces, J. Combin. Theory, Series B 46 (1989) 84-95] are generalized by way of generating new minimal quadrangulations of infinitely many other genera.

Comments: 6 pages. This version is only slightly different from the original version submitted on 8 Jul 2012: the author's affiliation has been changed and the presentation has been slightly improved
Journal: Journal of Combinatorial Mathematics and Combinatorial Computing (Canada) 87 (2013), 303-308
Categories: math.CO
Subjects: 05C10, 05C15, 05C75, 57M15
Related articles: Most relevant | Search more
arXiv:1212.3983 [math.CO] (Published 2012-12-17)
An Upper bound on the chromatic number of circle graphs without $K_4$
arXiv:math/0310339 [math.CO] (Published 2003-10-21)
Box complexes, neighborhood complexes, and the chromatic number
arXiv:0806.0178 [math.CO] (Published 2008-06-02, updated 2017-10-18)
On the concentration of the chromatic number of random graphs

Links

Toolbox