Irredundance perfect andP6-free graphs
From MaRDI portal
Publication:4242953
DOI10.1002/(SICI)1097-0118(199812)29:4%3C239::AID-JGT3%3E3.0.CO;2-MzbMATH Open0919.05033OpenAlexW2614342340MaRDI QIDQ4242953FDOQ4242953
Authors: Joël Puech 
Publication date: 31 August 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199812)29:4%3C239::aid-jgt3%3E3.0.co;2-m
Recommendations
- Irredundance perfect graphs
- A class of perfect graphs containing \(P_{6}\)
- Characterization of \(P_{6}\)-free graphs
- A New Characterization of P 6-Free Graphs
- A new characterization of \(P_{6}\)-free graphs
- Total dominations in \(P_6\)-free graphs
- Proof of a conjecture on irredundance perfect graphs
- scientific article; zbMATH DE number 6180527
- scientific article; zbMATH DE number 5844229
- Forbidden graphs and irredundant perfect graphs
Cited In (11)
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
- Irredundance perfect graphs
- Irredundant and perfect neighborhood sets in graphs and claw-free graphs
- Forbidden graphs and irredundant perfect graphs
- Characterization of \(P_{6}\)-free graphs
- Title not available (Why is that?)
- A new characterization of \(P_{6}\)-free graphs
- Automated generation of conjectures on forbidden subgraph characterization
- Irredundance
- Proof of a conjecture on irredundance perfect graphs
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
This page was built for publication: Irredundance perfect andP6-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242953)
