Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs

From MaRDI portal
Publication:1158444

DOI10.1016/0012-365X(81)90218-1zbMath0473.05049OpenAlexW2000335885MaRDI QIDQ1158444

S. H. Smith

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90218-1




Related Items (9)



Cites Work


This page was built for publication: Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs