Recommendations
Cites work
- scientific article; zbMATH DE number 3889565 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- Four classes of perfectly orderable graphs
- Locally perfect graphs
- On rigid circuit graphs
- Slim graphs
- The Comparability Graph of a Tree
- Topics on perfect graphs
Cited in
(8)- On pairwise compatibility graphs having Dilworth number \(k\)
- scientific article; zbMATH DE number 4125434 (Why is no real title available?)
- Recognizing quasi-triangulated graphs.
- A note on perfectly orderable graphs
- On simplicial and co-simplicial vertices in graphs.
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
- On some classes of quasi-triangulated graphs
- Recognition of some perfectly orderable graph classes
This page was built for publication: A note on perfect orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124614)