N-free posets as generalizations of series-parallel posets

DOI10.1016/0166-218X(85)90030-7zbMATH Open0635.06002MaRDI QIDQ1097286FDOQ1097286

Authors: M. A. Habib, Roland Jégou 

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmN-free posetsseries-parallel posets

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Partially Ordered Sets
• A Combinatorial Decomposition Theory
• Decomposition of Directed Graphs
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Topology of series-parallel networks
• Title not available (Why is that?)
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• Title not available (Why is that?)
• Maximal chains and antichains
• Linear-time computability of combinatorial problems on series-parallel graphs
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
• Title not available (Why is that?)
• The Jump Number of Dags and Posets: An Introduction
• Ordres "C.A.C."
• A labeling algorithm to recognize a line digraph and output its root graph
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
• Title not available (Why is that?)

Cited In (24)

• \(N\)-free extensions of posets. Note on a theorem of P. A. Grillet
• The queue-number of posets of bounded width or height
• Greedy balanced pairs in \(N\)-free ordered sets
• Parallel \(N\)-free order recognition
• Efficient polynomial algorithms for distributive lattices
• Contiguity orders
• Additive decomposition of matrices under rank conditions and zero pattern constraints
• Concurrency and atomicity
• Substitution and atomic extension on greedy posets
• Cross-series-parallel digraphs
• Linear extensions of N-free orders.
• Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
• The monadic second-order logic of graphs. XV: On a conjecture by D. Seese
• Linear extensions and continued fractions
• On structural descriptions of lower ideals of series parallel posets
• The arboreal jump number of an order
• Asymptotic enumeration of N-free partial orders
• Complexité de problèmes liés aux graphes sans circuit
• A new characterization of \(\mathcal{V} \)-posets
• A proof of the alternate Thomassé conjecture for countable \(N\)-free posets
• \(N\)-free orders and minimal interval extensions
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
• Title not available (Why is that?)
• Parallel interval order recognition and construction of interval representations

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)