Proof of a conjecture on irredundance perfect graphs

DOI10.1002/JGT.10068MaRDI QIDQ4798120zbMATH OpenOpenAlexWikidataFDO

Authors Lutz Volkmann, Vadim Zverovich

Publication date 19 March 2003

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10068

zbMATH Keywords

domination numberirredundance numberirredundance perfect graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A disproof of Henning's conjecture on irredundance perfect graphs
• Irredundance perfect graphs
• Irredundance perfect andP6-free graphs
• Domination and irredundance in cubic graphs
• Forbidden graphs and irredundant perfect graphs

Cited in

(10)

• Counterexamples to three conjectures concerning perfect graphs
• A disproof of Henning's conjecture on irredundance perfect graphs
• scientific article; zbMATH DE number 1416480 (Why is no real title available?)
• Irredundance perfect andP6-free graphs
• Forbidden graphs and irredundant perfect graphs
• Automated generation of conjectures on forbidden subgraph characterization
• Stability, domination and irredundance in a graph
• Irredundance
• A note on the irredundance number after vertex deletion
• scientific article; zbMATH DE number 6180527 (Why is no real title available?)

This page was built for publication: Proof of a conjecture on irredundance perfect graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798120)