N-free orders and minimal interval extensions

DOI10.1007/BF00383951zbMATH Open0766.06003MaRDI QIDQ1207724FDOQ1207724

M. Morvan, Jens Gustedt

Publication date: 16 May 1993

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

linear extensions\(N\)-free orders with isomorphic root graphlattice of maximal antichainslinegraphmaximal \(N\)-free reductionsminimal interval extensions of \(N\)-free orders

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Interval graphs and interval orders
• The Complexity of the Partial Order Dimension Problem
• Optimal Linear Extensions by Interchanging Chains
• The Dilworth theorems. Selected papers of Robert P. Dilworth. Edited by Kenneth P. Bogart, Ralph Freese and Joseph P. S. Kung
• Maximal chains and antichains
• Generating the Linear Extensions of Certain Posets by Transpositions
• Ordres "C.A.C."
• N-free posets as generalizations of series-parallel posets
• 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
• The jump number and the lattice of maximal antichains

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: \(N\)-free orders and minimal interval extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207724)