Polynomial time computability of some graph parameters for superclasses of perfect graphs

DOI10.1504/IJMOR.2012.046687zbMath1264.05132MaRDI QIDQ1758876

Arnaud Pêcher, Annegret K. Wagler

Publication date: 16 November 2012

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

zbMATH Keywords

polytopecircular-perfect graphcircular clique

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Related Items

On the theta number of powers of cycle graphs ⋮ On circular-perfect graphs: a survey