Irredundance perfect andP6-free graphs
From MaRDI portal
Publication:4242953
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199812)29:4<239::AID-JGT3>3.0.CO;2-M" /><239::AID-JGT3>3.0.CO;2-M 10.1002/(SICI)1097-0118(199812)29:4<239::AID-JGT3>3.0.CO;2-MzbMath0919.05033OpenAlexW2614342340MaRDI QIDQ4242953
Publication date: 31 August 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199812)29:4<239::aid-jgt3>3.0.co;2-m
Related Items (5)
On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs ⋮ Some results on maximum stable sets in certain \(P_{5}\)-free graphs ⋮ Automated generation of conjectures on forbidden subgraph characterization ⋮ Irredundance ⋮ Irredundant and perfect neighborhood sets in graphs and claw-free graphs
This page was built for publication: Irredundance perfect andP6-free graphs
