Pages that link to "Item:Q1811119"
From MaRDI portal
The following pages link to Recognition of some perfectly orderable graph classes (Q1811119):
Displaying 10 items.
- Characterization and recognition of some opposition and coalition graph classes (Q344867) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- Recognizing quasi-triangulated graphs. (Q1428566) (← links)
- Recognition algorithms for orders of small width and graphs of small Dilworth number (Q1771253) (← links)
- On the complexity of recognizing a class of perfectly orderable graphs (Q1917290) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial (Q2849360) (← links)
- Recognizing Bellman–Ford-Orderable Graphs (Q3832062) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902535) (← links)