Monotone Proper Interval Digraphs and Min-Max Orderings

DOI10.1137/100783844zbMath1261.05034OpenAlexW2060303752MaRDI QIDQ4915188

Arash Rafiey, Pavol Hell

Publication date: 9 April 2013

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

Full work available at URL: https://semanticscholar.org/paper/db41396394aeba3ed833915a08aa1a43f89ae5bd

zbMATH Keywords

forbidden structure characterizationsinterval digraphsminimum cost homomorphismsMin-Max orderings

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Strong Cocomparability Graphs and Slash-Free Orderings of Matrices ⋮ Min-Orderable Digraphs ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ Unnamed Item

This page was built for publication: Monotone Proper Interval Digraphs and Min-Max Orderings