The following pages link to Forbidden ordered subgraphs (Q3971999):
Displaying 25 items.
- Strict chordal and strict split digraphs (Q516787) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- On forbidden subdivision characterizations of graph classes (Q925035) (← links)
- Distances in cocomparability graphs and their powers (Q1183347) (← links)
- Forbidden induced partial orders (Q1301728) (← links)
- Proper and unit bitolerance orders and graphs (Q1381846) (← links)
- Forbidden subgraph decomposition (Q1598796) (← links)
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs (Q1752498) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Describing hereditary properties by forbidden circular orderings (Q2096309) (← links)
- Oriented expressions of graph properties (Q2145766) (← links)
- On grounded \(\llcorner\)-graphs and their relatives (Q2315438) (← links)
- On characterizations by nice forbidding sets (Q2857350) (← links)
- (Q3826590) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- (Q5005172) (← links)
- Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
- Min-Orderable Digraphs (Q5130576) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- Recognizing interval bigraphs by forbidden patterns (Q6081553) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words (Q6611075) (← links)
- Forbidden tournaments and the orientation completion problem (Q6668354) (← links)
