Pages that link to "Item:Q4851929"
From MaRDI portal
The following pages link to On the computational complexity of ordered subgraph recognition (Q4851929):
Displaying 12 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Computing an evolutionary ordering is hard (Q324805) (← links)
- The complexity of regular subgraph recognition (Q912615) (← links)
- On the complexity of diagram testing (Q1319079) (← links)
- Proper and unit bitolerance orders and graphs (Q1381846) (← links)
- On the complexity of partial order properties (Q1590180) (← links)
- On the complexity of recognizing a class of perfectly orderable graphs (Q1917290) (← links)
- On grounded \(\llcorner\)-graphs and their relatives (Q2315438) (← links)
- Recognizing Bellman–Ford-Orderable Graphs (Q3832062) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Recognizing interval bigraphs by forbidden patterns (Q6081553) (← links)
- Forbidden tournaments and the orientation completion problem (Q6668354) (← links)