On-line graph coloring of P₅-free graphs

ISSN： 0001-5903

Source： Acta Informatica, Vol.45, Iss.2, 2008-04, pp. : 79-91

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

Fast 3-coloring Triangle-Free Planar Graphs

By Kowalik Lukasz

Algorithmica, Vol. 58, Iss. 3, 2010-11 ,pp. : 770-789

Springer Publishing Company

Access to resources Recommend Favorite

Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images

By Khachan M. Chenin P. deddi H.

Computer Vision and Image Understanding, Vol. 79, Iss. 3, 2000-09 ,pp. : 428-441

Academic Press

Access to resources Recommend Favorite

A Simple O(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

By Gupta S.S. Sinha B.P.

Journal of Parallel and Distributed Computing, Vol. 56, Iss. 2, 1999-02 ,pp. : 144-155

Academic Press

Access to resources Recommend Favorite

Facets of the Graph Coloring Polytope

By Coll P.

Annals of Operations Research, Vol. 116, Iss. 1-4, 2002-10 ,pp. : 79-90

Springer Publishing Company

Access to resources Recommend Favorite

Frozen development in graph coloring

By Culberson J. Gent I.

Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. : 227-264

Elsevier

Access to resources Recommend Favorite