Contiguity orders
From MaRDI portal
Publication:6567688
DOI10.1007/3-540-61576-8_89zbMATH Open1540.06001MaRDI QIDQ6567688FDOQ6567688
Authors: Vincent Bouchitté, Abdelmajid Hilali, Roland Jégou, Jean-Xavier Rampon 
Publication date: 5 July 2024
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07)
Cites Work
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Counting linear extensions
- Bipartite permutation graphs
- Title not available (Why is that?)
- Tackling the jump number of interval orders
- On Comparability and Permutation Graphs
- Planar Lattices
- Title not available (Why is that?)
- Comparability invariance of the fixed point property
- N-free posets as generalizations of series-parallel posets
- Representing orders on the plane by translating convex figures
- Algorithmic characterizations of interval orderd hypergraphs and applications
- Computing the dimension of N-free ordered sets is NP-complete
- Line directionality of orders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
