Adjusted Interval Digraphs
From MaRDI portal
Publication:2839215
DOI10.1016/j.endm.2009.02.012zbMath1267.05257OpenAlexW2055646787MaRDI QIDQ2839215
Arash Rafiey, Jing Huang, Tomás Feder, Pavol Hell
Publication date: 4 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.02.012
Related Items (4)
Recognition and characterization of chronological interval digraphs ⋮ Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms ⋮ The \(C_{k}\)-extended graft construction ⋮ Miscellaneous Digraph Classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognition and characterization of chronological interval digraphs
- Digraph matrix partitions and trigraph homomorphisms
- On the complexity of H-coloring
- A characterization of interval catch digraphs
- List homomorphisms to reflexive graphs
- Polynomial graph-colorings
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Dichotomies for classes of homomorphism problems involving unary functions
- Complexity of tree homomorphisms
- List homomorphisms and circular arc graphs
- Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability
- Complexity of conservative constraint satisfaction problems
- Representation of a finite graph by a set of intervals on the real line
- Interval digraphs: An analogue of interval graphs
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Bi‐arc graphs and the complexity of list homomorphisms
- Minimum Cost Homomorphisms to Reflexive Digraphs
- A Characterization of Comparability Graphs and of Interval Graphs
This page was built for publication: Adjusted Interval Digraphs
