Some classes of strongly perfect graphs

DOI10.1016/S0012-365X(98)00407-5zbMath0928.05028OpenAlexW2105838663WikidataQ127829989 ScholiaQ127829989MaRDI QIDQ1304823

G. Ravindra

Publication date: 2 January 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00407-5

zbMATH Keywords

comparability graphindependent setline graphchromatic numberMeyniel graphstrongly perfect graphcostrongly perfect graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

Related Items (5)

New examples of minimal non-strongly-perfect graphs ⋮ Structural properties of super strongly perfect graphs ⋮ Structure of super strongly perfect graphs ⋮ Strongly perfect claw‐free graphs—A short proof ⋮ Depth and regularity of monomial ideals via polarization and combinatorial optimization

This page was built for publication: Some classes of strongly perfect graphs