N-free posets as generalizations of series-parallel posets
From MaRDI portal
(Redirected from Publication:1097286)
Recommendations
- Series parallel posets with nonfinitely generated clones
- Series-parallel posets and relative Ockham lattices
- Series-parallel posets and the Tutte polynomial
- Retractions onto series-parallel posets
- Posets with series parallel orders and strict-double-bound graphs
- The setup polyhedron of series-parallel posets
- \(N\)-free extensions of posets. Note on a theorem of P. A. Grillet
- The order type of the collection of finite series-parallel posets
- The permutahedron of series-parallel posets
- The permutahedron of series-parallel posets
Cites work
- scientific article; zbMATH DE number 3877241 (Why is no real title available?)
- scientific article; zbMATH DE number 3657692 (Why is no real title available?)
- scientific article; zbMATH DE number 3786844 (Why is no real title available?)
- scientific article; zbMATH DE number 3641455 (Why is no real title available?)
- scientific article; zbMATH DE number 3218572 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- A labeling algorithm to recognize a line digraph and output its root graph
- Decomposition of Directed Graphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- Maximal chains and antichains
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Ordres "C.A.C."
- Partially Ordered Sets
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- The Jump Number of Dags and Posets: An Introduction
- Topology of series-parallel networks
Cited in
(24)- On structural descriptions of lower ideals of series parallel posets
- Additive decomposition of matrices under rank conditions and zero pattern constraints
- \(N\)-free orders and minimal interval extensions
- A new characterization of \(\mathcal{V} \)-posets
- Asymptotic enumeration of N-free partial orders
- Efficient polynomial algorithms for distributive lattices
- The queue-number of posets of bounded width or height
- Parallel interval order recognition and construction of interval representations
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
- Concurrency and atomicity
- Complexité de problèmes liés aux graphes sans circuit
- Cross-series-parallel digraphs
- Linear extensions and continued fractions
- Substitution and atomic extension on greedy posets
- The arboreal jump number of an order
- \(N\)-free extensions of posets. Note on a theorem of P. A. Grillet
- scientific article; zbMATH DE number 7583268 (Why is no real title available?)
- Contiguity orders
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
- Linear extensions of N-free orders.
- Greedy balanced pairs in \(N\)-free ordered sets
- Parallel \(N\)-free order recognition
- A proof of the alternate Thomassé conjecture for countable \(N\)-free posets
This page was built for publication: N-free posets as generalizations of series-parallel posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097286)
