Proper and unit bitolerance orders and graphs
From MaRDI portal
Publication:1381846
DOI10.1016/S0012-365X(97)00043-5zbMath0894.05050OpenAlexW2170157130MaRDI QIDQ1381846
Garth Isaak, Kenneth P. Bogart
Publication date: 31 August 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00043-5
Related Items
Generalizations of semiorders: A review note ⋮ The recognition of triangle graphs ⋮ An intersection model for multitolerance graphs: efficient algorithms and hierarchy ⋮ A characterization of interval orders with semiorder dimension two ⋮ The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial ⋮ Split semiorders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An obvious proof of Fishburn's interval order theorem
- Tolerance graphs
- Trapezoid graphs and their coloring
- Algorithms for interval catch digraphs
- Bipartite tolerance orders
- Proper and unit tolerance graphs
- Intransitive indifference with unequal indifference intervals
- Domination on Cocomparability Graphs
- Semiorders and a Theory of Utility Discrimination
- Foundational aspects of theories of measurement
- Unit and proper bitolerance digraphs
- On the computational complexity of ordered subgraph recognition
- Pseudo‐Interval Graphs