A characterization of interval orders with semiorder dimension two
From MaRDI portal
Publication:2022521
Recommendations
Cites work
- scientific article; zbMATH DE number 3853140 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A recognition algorithm for orders of interval dimension two
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- On powers of m-trapezoid graphs
- On the 2-Chain Subgraph Cover and Related Problems
- On the non-unit count of interval graphs
- Proper and unit bitolerance orders and graphs
- Proper and unit tolerance graphs
- Proper and unit trapezoid orders and graphs
- Semi-order dimension two is a comparability invariant
- Simple inductive proofs of the Fishburn and Mirkin theorem and the Scott-Suppes theorem
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The dimension of semiorders
- The recognition of tolerance and bounded tolerance graphs
- Trapezoid graphs and generalizations, geometry and algorithms
- Trapezoid graphs and their coloring
- Triangulating multitolerance graphs
- Vertex splitting and the recognition of trapezoid graphs
Cited in
(5)- A characterization of PQI interval orders.
- Inductive characterizations of finite interval orders and semiorders
- Semi-order dimension two is a comparability invariant
- A simple proof characterizing interval orders with interval lengths between 1 and \(k\)
- Hereditary semiorders and enumeration of semiorders by dimension
This page was built for publication: A characterization of interval orders with semiorder dimension two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022521)