New classes of perfectly orderable graphs
From MaRDI portal
Publication:5959094
Recommendations
Cited in
(17)- Perfectly orderable graphs are quasi-parity graphs: a short proof
- Properly orderable graphs
- On the perfect orderability of unions of two graphs
- Partial characterizations of 1-perfectly orientable graphs
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
- Perfectly orderable graphs: A survey
- Perfectly orderable graphs and unique colorability
- Four classes of perfectly orderable graphs
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Some classes of perfectly orderable graphs
- A charming class of perfectly orderable graphs
- Which claw-free graphs are perfectly orderable?
- scientific article; zbMATH DE number 3885965 (Why is no real title available?)
- On the complexity of recognizing perfectly orderable graphs
- scientific article; zbMATH DE number 4045795 (Why is no real title available?)
- Generalized neighbourhoods and a class of perfectly orderable graphs
- On the complexity of recognizing a class of perfectly orderable graphs
This page was built for publication: New classes of perfectly orderable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959094)