A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.81, Iss.1, 1998-01, pp. : 307-320

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

Improving an Upper Bound on the Stability Number of a Graph

By Luz Carlos

Journal of Global Optimization, Vol. 31, Iss. 1, 2005-01 ,pp. : 61-84

Springer Publishing Company

Access to resources Recommend Favorite

Connectionist learning of regular graph grammars

By Fletcher Peter

Connection Science, Vol. 13, Iss. 2, 2001-06 ,pp. : 127-188

Taylor & Francis Ltd

Access to resources Recommend Favorite

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

By Fomin Fedor V. Heggernes Pinar Telle Jan Arne

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 73-87

Springer Publishing Company

Access to resources Recommend Favorite

On Dissemination Thresholds in Regular and Irregular Graph Classes

By Rapaport I. Suchan K. Todinca I. Verstraete J.

Algorithmica, Vol. 59, Iss. 1, 2011-01 ,pp. : 16-34

Springer Publishing Company

Access to resources Recommend Favorite

Regular Description of Context-free Graph Languages

By Engelfriet J. van Oostrom V.

Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. : 556-574

Academic Press

Access to resources Recommend Favorite