Pages that link to "Item:Q1097286"

The following pages link to N-free posets as generalizations of series-parallel posets (Q1097286):

Displaying 20 items.

• Parallel interval order recognition and construction of interval representations (Q673637) (← links)
• Efficient polynomial algorithms for distributive lattices (Q810071) (← links)
• On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
• Substitution and atomic extension on greedy posets (Q1104347) (← links)
• Concurrency and atomicity (Q1124366) (← links)
• \(N\)-free orders and minimal interval extensions (Q1207724) (← links)
• Parallel \(N\)-free order recognition (Q1392213) (← links)
• The queue-number of posets of bounded width or height (Q1725753) (← links)
• The arboreal jump number of an order (Q1943701) (← links)
• Cross-series-parallel digraphs (Q1983112) (← links)
• Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs (Q2020704) (← links)
• Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
• Linear extensions of N-free orders. (Q2351714) (← links)
• The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
• Complexité de problèmes liés aux graphes sans circuit (Q3773334) (← links)
• (Q5104004) (← links)
• Additive decomposition of matrices under rank conditions and zero pattern constraints (Q5867140) (← links)
• Contiguity orders (Q6567688) (← links)
• Linear extensions and continued fractions (Q6612298) (← links)
• A proof of the alternate Thomassé conjecture for countable \(N\)-free posets (Q6663917) (← links)