On perfect switching classes
From MaRDI portal
Recommendations
Cites work
- A Linear Recognition Algorithm for Cographs
- Bull-free Berge graphs are perfect
- scientific article; zbMATH DE number 125469 (Why is no real title available?)
- scientific article; zbMATH DE number 3547309 (Why is no real title available?)
- On deciding switching equivalence of graphs
- Recognizing \(P_ 3\)-structure: A switching approach
Cited in
(7)
This page was built for publication: On perfect switching classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5906340)