Hard graphs for the maximum clique problem

DOI10.1016/0012-365X(88)90207-5zbMath0698.05040OpenAlexW2078489643MaRDI QIDQ5899769

Cornelis Hoede

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90207-5

zbMATH Keywords

NP-complete problemsmaximum clique problemindependent clique problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

The maximum clique problem ⋮ Clique polynomials and independent set polynomials of graphs

This page was built for publication: Hard graphs for the maximum clique problem