The following pages link to Complexity of diagrams (Q1316621):
Displaying 20 items.
- Planar posets, dimension, breadth and the number of minimal elements (Q304190) (← links)
- Weakly transitive orientations, Hasse diagrams and string graphs (Q686503) (← links)
- Enumerating orientations of ordered sets (Q803181) (← links)
- Efficient polynomial algorithms for distributive lattices (Q810071) (← links)
- On the complexity of cover-incomparability graphs of posets (Q841163) (← links)
- Diagrams, orientations, and varieties (Q911621) (← links)
- Cover-incomparability graphs of posets (Q1013992) (← links)
- Covering posets (Q1108294) (← links)
- Reorientations of covering graphs (Q1176721) (← links)
- Lattices contained in planar orders are planar (Q1208077) (← links)
- Every triangle-free planar graph has a planar upward drawing (Q1311415) (← links)
- On the complexity of diagram testing (Q1319079) (← links)
- Constructing colorings for diagrams (Q1329806) (← links)
- On edge transitivity of directed graphs (Q1894773) (← links)
- The complexity of cover graph recognition for some varieties of finite lattices (Q1908932) (← links)
- Tree-width and dimension (Q2400108) (← links)
- Inversions, cuts, and orientations (Q2640623) (← links)
- Orders with level diagrams (Q2640624) (← links)
- $st$-Orientations with Few Transitive Edges (Q6141787) (← links)
- Contact graphs of boxes with unidirectional contacts (Q6599818) (← links)
