Pages that link to "Item:Q1086264"
From MaRDI portal
The following pages link to On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264):
Displayed 19 items.
- Efficient polynomial algorithms for distributive lattices (Q810071) (← links)
- Asymptotic enumeration of N-free partial orders (Q913831) (← links)
- New bijective links on planar maps via orientations (Q1041192) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949) (← links)
- An algorithm for solving the jump number problem (Q1113927) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- Counting linear extensions (Q1183942) (← links)
- \(N\)-free orders and minimal interval extensions (Q1207724) (← links)
- PLA folding in special graph classes (Q1329804) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- On some new types of greedy chains and greedy linear extensions of partially ordered sets (Q1894377) (← links)
- On the structure of trapezoid graphs (Q1917308) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Regularity of residuated mappings (Q2277498) (← links)
- Linear extensions of N-free orders. (Q2351714) (← links)
- Relative Ockham lattices: their order-theoretic and algebraic characterisation (Q3035345) (← links)
- On the Jump Number of Lexicographic Sums of Ordered Sets (Q4429242) (← links)