Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
From MaRDI portal
Publication:411837
DOI10.1016/j.dam.2011.06.024zbMath1239.05079MaRDI QIDQ411837
Maria Chudnovsky, Bernard Ries, Yori Zwols
Publication date: 30 April 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.024
forbidden induced subgraphs; wireless networking; claw-free graphs; structural graph theory; strongly perfect graphs
68M10: Network design and communication in computer systems
05C75: Structural characterization of families of graphs
05C17: Perfect graphs