The following pages link to A note on perfect orders (Q1124614):
Displaying 8 items.
- A bound for the Dilworth number (Q809096) (← links)
- On simplicial and co-simplicial vertices in graphs. (Q1428559) (← links)
- Recognizing quasi-triangulated graphs. (Q1428566) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- A note on perfectly orderable graphs (Q1917281) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- On some classes of quasi-triangulated graphs (Q6633557) (← links)
