Recommendations
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- Bipolarizable graphs
- Decomposition of Directed Graphs
- scientific article; zbMATH DE number 3172312 (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?)
- Some classes of perfectly orderable graphs
Cited in
(21)- Even and odd pairs in comparability and in P₄-comparability graphs
- Recognition of some perfectly orderable graph classes
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability
- Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- On the complexity of recognizing a class of perfectly orderable graphs
- On the \(P_4\)-components of graphs
- A characterization of \(P_{4}\)-comparability graphs
- Perfectly orderable P₄ composition
- Some classes of perfectly orderable graphs
- scientific article; zbMATH DE number 1309107 (Why is no real title available?)
- scientific article; zbMATH DE number 1953107 (Why is no real title available?)
- scientific article; zbMATH DE number 2081001 (Why is no real title available?)
- Parallel algorithms for P4-comparability graphs
- On the perfect orderability of unions of two graphs
- On the recognition of bipolarizable and \(P_4\)-simplicial graphs
- Recognizing bipolarizable and \(P _{4}\)-simplicial graphs.
- On the recognition of \(P_4\)-indifferent graphs
- On some algorithms and properties of comparability graphs
- Which claw-free graphs are perfectly orderable?
- On the complexity of recognizing perfectly orderable graphs
This page was built for publication: \(P_ 4\)-comparability graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121924)
