On clique-colouring of graphs with few P ₄’s

ISSN： 0104-6500

Source： Journal of the Brazilian Computer Society, Vol.18, Iss.2, 2012-06, pp. : 113-119

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

Dominating Induced Matchings for P ₇-Free Graphs in Linear Time

By Brandstädt Andreas Mosca Raffaele

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 998-1018

Springer Publishing Company

Access to resources Recommend Favorite

Fast evaluation of the hypergeometric function _p F _p−1(a; b; z) at the singular point z = 1 by means of the Hurwitz zeta function ζ(α, s)

By Bogolubsky A. Skorokhodov S.

Programming and Computer Software, Vol. 32, Iss. 3, 2006-05 ,pp. : 145-153

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On edge-colouring indifference graphs

By de Figueiredo C.M.H. Meidanis J. de Mello C.P.

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 91-106

Elsevier

Access to resources Recommend Favorite

A new smoothing and regularization Newton method for P ₀-NCP

By Ma Changfeng

Journal of Global Optimization, Vol. 48, Iss. 2, 2010-10 ,pp. : 241-261

Springer Publishing Company

Access to resources Recommend Favorite

On the application of the P₁^mod element to incompressible flow problems

By Knobloch Petr

Computing and Visualization in Science, Vol. 6, Iss. 4, 2004-04 ,pp. : 185-195

Springer Publishing Company

Access to resources Recommend Favorite