Hell, Pavol; Huang, Jing; Lin, Jephian C.-H. Strong cocomparability graphs and slash-free orderings of matrices. (English) Zbl 07809682 SIAM J. Discrete Math. 38, No. 1, 828-844 (2024). MSC: 05C50 05C75 06A07 PDFBibTeX XMLCite \textit{P. Hell} et al., SIAM J. Discrete Math. 38, No. 1, 828--844 (2024; Zbl 07809682) Full Text: DOI arXiv
Hell, Pavol; Huang, Jing; McConnell, Ross M.; Rafiey, Arash Min-orderable digraphs. (English) Zbl 1450.05036 SIAM J. Discrete Math. 34, No. 3, 1710-1724 (2020). MSC: 05C20 05C75 05C62 05C17 PDFBibTeX XMLCite \textit{P. Hell} et al., SIAM J. Discrete Math. 34, No. 3, 1710--1724 (2020; Zbl 1450.05036) Full Text: DOI
Rafiey, Akbar; Rafiey, Arash; Santos, Thiago Toward a dichotomy for approximation of \(H\)-coloring. (English) Zbl 07561584 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 91, 16 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{A. Rafiey} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 91, 16 p. (2019; Zbl 07561584) Full Text: DOI arXiv
Larose, Benoit Algebra and the complexity of digraph CSPs: a survey. (English) Zbl 1482.68166 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 267-285 (2017). MSC: 68R07 05C20 08A70 68Q25 68R10 PDFBibTeX XMLCite \textit{B. Larose}, Dagstuhl Follow-Ups 7, 267--285 (2017; Zbl 1482.68166) Full Text: DOI