Bounding the Independence Number of a Graph
DOI10.1016/S0304-0208(08)72453-8zbMATH Open0502.05051OpenAlexW1016912189WikidataQ89220149 ScholiaQ89220149MaRDI QIDQ3967569FDOQ3967569
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99)
Cited In (5)
- 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
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
- A note on graph colorings and graph polynomials
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)
