Bounding the Independence Number of a Graph

DOI10.1016/S0304-0208(08)72453-8MaRDI QIDQ3967569zbMATH OpenOpenAlexWikidataFDO

Authors László Lovász

Publication date 1982

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)72453-8

zbMATH Keywords

independence numberNP-complete

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(5)

• A note on graph colorings and graph polynomials
• Computing the chromatic number using graph decompositions via matrix rank
• A Derivation of Lovász' Theta via Augmented Lagrange Duality
• Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
• On two generalizations of the Alon-Tarsi polynomial method

This page was built for publication: Bounding the Independence Number of a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967569)