Contiguity orders

DOI10.1007/3-540-61576-8_89MaRDI QIDQ6567688zbMATHFDO

Authors Vincent Bouchitté, Abdelmajid Hilali, Roland Jégou, Jean-Xavier Rampon

Publication date 5 July 2024

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07)

Recommendations

• \(N\)-free orders and minimal interval extensions
• scientific article; zbMATH DE number 4214076
• Tree-visibility orders
• scientific article; zbMATH DE number 512933
• Counting interval orders

Cites work

• scientific article; zbMATH DE number 17532 (Why is no real title available?)
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1554939 (Why is no real title available?)
• scientific article; zbMATH DE number 221692 (Why is no real title available?)
• scientific article; zbMATH DE number 6157240 (Why is no real title available?)
• Algorithmic characterizations of interval orderd hypergraphs and applications
• Bipartite permutation graphs
• Comparability invariance of the fixed point property
• Computing the dimension of N-free ordered sets is NP-complete
• Counting linear extensions
• Line directionality of orders
• N-free posets as generalizations of series-parallel posets
• On Comparability and Permutation Graphs
• Planar Lattices
• Representing orders on the plane by translating convex figures
• Tackling the jump number of interval orders
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(1)

• Containment orders – a lifelong journey

This page was built for publication: Contiguity orders

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