Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 3683635 (Why is no real title available?)
- scientific article; zbMATH DE number 1944138 (Why is no real title available?)
- A charming class of perfectly orderable graphs
- A note on perfect orders
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Doubly Lexical Orderings of Matrices
- Four classes of perfectly orderable graphs
- New properties of perfectly orderable graphs and strongly perfect graphs
- On rigid circuit graphs
- On the complexity of recognizing perfectly orderable graphs
- Totally-Balanced and Greedy Matrices
- Which claw-free graphs are perfectly orderable?
Cited in
(11)- Perfectly orderable graphs are quasi-parity graphs: a short proof
- A note on totally-omnitonal graphs
- On the perfect orderability of unions of two graphs
- scientific article; zbMATH DE number 15158 (Why is no real title available?)
- Perfectly orderable graphs and unique colorability
- A note on perfect orders
- A Note on the Order of Iterated Line Digraphs
- scientific article; zbMATH DE number 7251236 (Why is no real title available?)
- Homogeneously orderable graphs
- Which line-graphs are perfectly orderable?
- On the complexity of recognizing a class of perfectly orderable graphs
This page was built for publication: A note on perfectly orderable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917281)