The following pages link to (Q3684157):
Displayed 22 items.
- The complexity of embedding orders into small products of chains (Q603886) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- Dimensions of hypergraphs (Q757427) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- A note on the interval number of a graph (Q1065014) (← links)
- ``Poly-unsaturated'' posets: The Greene-Kleitman theorem is best possible (Q1069961) (← links)
- Interval representations of planar graphs (Q1077425) (← links)
- Unichain coverings in partial orders with the nested saturation property (Q1086262) (← links)
- Poset boxicity of graphs (Q1103652) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- The total interval number of a graph (Q1119605) (← links)
- On the unit interval number of a graph (Q1120600) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- The interval inclusion number of a partially ordered set (Q1176729) (← links)
- An interval digraph in relation to its associated bipartite graph (Q1313853) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- Simple games and magic squares (Q1894010) (← links)
- Intersection number and capacities of graphs (Q1896353) (← links)
- Kernels of minimum size gossip schemes (Q1897431) (← links)
- 4-connected triangulations on few lines (Q2206872) (← links)
- Finite posets and Ferrers shapes (Q5937633) (← links)
- On the duality of semiantichains and unichain coverings. (Q5965139) (← links)