The following pages link to \(P_ 4\)-comparability graphs (Q1121924):
Displaying 19 items.
- Which claw-free graphs are perfectly orderable? (Q686245) (← links)
- On the complexity of recognizing perfectly orderable graphs (Q918707) (← links)
- Even and odd pairs in comparability and in \(P_4\)-comparability graphs (Q1283809) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability (Q1827860) (← links)
- Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation (Q1882629) (← links)
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs (Q1897443) (← links)
- On the complexity of recognizing a class of perfectly orderable graphs (Q1917290) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- A characterization of \(P_{4}\)-comparability graphs (Q2433707) (← links)
- Perfectly orderable \(P_4\) composition (Q2741505) (← links)
- Some classes of perfectly orderable graphs (Q3831058) (← links)
- A characterization of \(P_4\)-indifference graphs (Q4256088) (← links)
- (Q4414511) (← links)
- (Q4474099) (← links)
- Parallel algorithms for P4-comparability graphs (Q4818673) (← links)
- On the perfect orderability of unions of two graphs (Q4944684) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902535) (← links)
- On the recognition of \(P_4\)-indifferent graphs (Q5946757) (← links)
