Pages that link to "Item:Q1917290"
From MaRDI portal
The following pages link to On the complexity of recognizing a class of perfectly orderable graphs (Q1917290):
Displaying 18 items.
- Characterization and recognition of some opposition and coalition graph classes (Q344867) (← links)
- Meyniel weakly triangulated graphs. I: Co-perfect orderability (Q678852) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- On the complexity of recognizing perfectly orderable graphs (Q918707) (← links)
- \(P_ 4\)-comparability graphs (Q1121924) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability (Q1827860) (← links)
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders (Q2322885) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
- Perfectly orderable graphs: A survey (Q2758336) (← links)
- The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (Q2883612) (← links)
- Four classes of perfectly orderable graphs (Q3800062) (← links)
- Some classes of perfectly orderable graphs (Q3831058) (← links)
- Recognizing Bellman–Ford-Orderable Graphs (Q3832062) (← links)
- On the computational complexity of ordered subgraph recognition (Q4851929) (← links)
- On the perfect orderability of unions of two graphs (Q4944684) (← links)
- Recognizing \(k\)-clique extendible orderings (Q5925536) (← links)