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 5 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)
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability (Q1827860) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
