arXiv Analytics

Sign in

arXiv:1706.03109 [math.CO]AbstractReferencesReviewsResources

Complete colorings of planar graphs

M. Gabriela Araujo-Pardo, F. Esteban Contreras-Mendoza, Sara J. Murillo-García, Andrea B. Ramos-Tort, Christian Rubio-Montiel

Published 2017-06-09Version 1

In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We give asymptotically tight results and lower bounds for maximal embedded graphs.

Related articles: Most relevant | Search more
arXiv:1006.3783 [math.CO] (Published 2010-06-18)
Crossings, colorings, and cliques
arXiv:1008.2250 [math.CO] (Published 2010-08-13)
Colouring the Square of the Cartesian Product of Trees
arXiv:1306.4941 [math.CO] (Published 2013-06-20)
Upper and lower bounds on $B_k^+$-sets