Pages that link to "Item:Q1319079"
From MaRDI portal
The following pages link to On the complexity of diagram testing (Q1319079):
Displaying 11 items.
- Planar posets, dimension, breadth and the number of minimal elements (Q304190) (← links)
- On the complexity of cover-incomparability graphs of posets (Q841163) (← links)
- Semi-transitive orientations and word-representable graphs (Q908303) (← links)
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
- Independent arcs of acyclic orientations of complete \(r\)-partite graphs (Q1043945) (← links)
- The number of dependent arcs in an acyclic orientation (Q1386477) (← links)
- The complexity of cover graph recognition for some varieties of finite lattices (Q1908932) (← links)
- Enumerating \(k\)-arc-connected orientations (Q2211357) (← links)
- Tree-width and dimension (Q2400108) (← links)
- Dimension and height for posets with planar cover graphs. (Q2509772) (← links)
- $st$-Orientations with Few Transitive Edges (Q6141787) (← links)
