On the recursive largest first algorithm for graph colouring

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.85, Iss.2, 2008-02, pp. : 191-200

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

Abstract

Related content

Building graph separators with the recursive rotation algorithm for the nested dissection method

By Maslovskaya L. Maslovskaya O.

Numerical Analysis and Applications, Vol. 3, Iss. 3, 2010-07 ,pp. : 241-262

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

CsegGraph: a graph colouring instance generator

By Hossain Shahadat

International Journal of Computer Mathematics, Vol. 86, Iss. 10-11, 2009-10 ,pp. : 1956-1967

Taylor & Francis Ltd

Access to resources Recommend Favorite

A graph edge colouring approach for school timetabling problems

By Badoni Rakesh P. Gupta D.K.

International Journal of Mathematics in Operational Research, Vol. 6, Iss. 1, 2014-11 ,pp. : 123-138

Inderscience Publishers

Access to resources Recommend Favorite

Largest connected component of a star graph with faulty vertices

By Yang Xiaofan

International Journal of Computer Mathematics, Vol. 85, Iss. 12, 2008-12 ,pp. : 1771-1778

Taylor & Francis Ltd

Access to resources Recommend Favorite

Principal graph stability and the jellyfish algorithm

By Bigelow Stephen Penneys David

Mathematische Annalen, Vol. 358, Iss. 1-2, 2014-02 ,pp. : 1-24

Springer Publishing Company

Access to resources Recommend Favorite