The following pages link to (Q3890731):
Displaying 19 items.
- Jump number of dags having Dilworth number 2 (Q791537) (← links)
- The jump number and the lattice of maximal antichains (Q807648) (← links)
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles (Q834189) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- Simplicial elimination schemes, extremal lattices and maximal antichain lattices (Q1815843) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Positive matching decompositions of graphs (Q2166243) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- On unicyclic graphs with uniquely restricted maximum matchings (Q2637732) (← links)
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
- Unicycle graphs and uniquely restricted maximum matchings (Q3439344) (← links)
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach (Q3665161) (← links)
- Optimal Linear Extensions by Interchanging Chains (Q3674720) (← links)
- On-line computations of the ideal lattice of posets (Q4850326) (← links)
