Comparability graphs with constraint, partial semi-orders and interval orders

DOI10.1016/0012-365X(85)90131-1zbMath0581.05049OpenAlexW2086112218MaRDI QIDQ1068108

Claude Flament

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90131-1

zbMATH Keywords

comparability graphtransitive orientationimplication closuremulti-weak orderpartial interval orderpartial semiordersuperconstraint

Mathematics Subject Classification ID

Partial orders, general (06A06) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On incomplete preference structures

Cites Work

• Comparability graphs and a new matroid
• Intransitive indifference with unequal indifference intervals
• Semiorders and a Theory of Utility Discrimination
• Transitiv orientierbare Graphen
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparability graphs with constraint, partial semi-orders and interval orders