An Upper Bound for Some Coloring Problem

Author： Januszewski Janusz  

Publisher： Mathematical Association of America

E-ISSN： 1930-0972|122|5|481-481

ISSN： 1930-0972

Source： American Mathematical Monthly, Vol.122, Iss.5, 2015-05, pp. : 481-481

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On the max-weight edge coloring problem

By Lucarelli Giorgio   Milis Ioannis   Paschos Vangelis  

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 429-442

Springer Publishing Company

Access to resources Recommend Favorite

An Upper Bound for Spherical Caps

By Tkocz Tomasz  

American Mathematical Monthly, Vol. 119, Iss. 7, 2012-08 ,pp. : 606-607

Mathematical Association of America

Access to resources Recommend Favorite

Two Novel Evolutionary Formulations of the Graph Coloring Problem

By Barbosa Valmir C.   Assis Carlos A.G.   Do Nascimento Josina O.  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 41-63

Springer Publishing Company

Access to resources Recommend Favorite

Higher-Dimensional Analogues of the Map Coloring Problem

By Bagchi Bhaskar   Datta Basudeb  

American Mathematical Monthly, Vol. 120, Iss. 8, 2013-10 ,pp. : 733-737

Mathematical Association of America

Access to resources Recommend Favorite

A branch‐and‐price algorithm for the (k,c)‐coloring problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 353-366

John Wiley & Sons Inc

Access to resources Recommend Favorite