Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphism problems for signed trees. (English) Zbl 1506.05082 Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023). MSC: 05C22 05C05 68Q15 05C60 PDFBibTeX XMLCite \textit{J. Bok} et al., Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023; Zbl 1506.05082) Full Text: DOI
Ducoffe, Guillaume Beyond Helly graphs: the diameter problem on absolute retracts. (English) Zbl 07538587 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 321-335 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{G. Ducoffe}, Lect. Notes Comput. Sci. 12911, 321--335 (2021; Zbl 07538587) Full Text: DOI arXiv
Jaffe, Adam Characterizing bipartite graphs which admit a \(k\)-NU polymorphism via absolute retracts. (English) Zbl 1479.05229 Graphs Comb. 37, No. 6, 2459-2466 (2021). MSC: 05C60 05C70 05C75 08B05 PDFBibTeX XMLCite \textit{A. Jaffe}, Graphs Comb. 37, No. 6, 2459--2466 (2021; Zbl 1479.05229) Full Text: DOI arXiv
Vikas, Narayan Computational complexity relationship between compaction, vertex-compaction, and retraction. (English) Zbl 1410.68181 J. Discrete Algorithms 52-53, 168-181 (2018). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{N. Vikas}, J. Discrete Algorithms 52--53, 168--181 (2018; Zbl 1410.68181) Full Text: DOI
Vikas, Narayan Computational complexity of graph partition under vertex-compaction to an irreflexive hexagon. (English) Zbl 1441.68197 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 69, 14 p. (2017). MSC: 68R10 05C70 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{N. Vikas}, LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 69, 14 p. (2017; Zbl 1441.68197) Full Text: DOI
Groshaus, Marina; Lin, Min Chih; Szwarcfiter, Jayme L. On neighborhood-Helly graphs. (English) Zbl 1350.05167 Discrete Appl. Math. 216, Part 1, 191-202 (2017). MSC: 05C99 52A35 68Q17 PDFBibTeX XMLCite \textit{M. Groshaus} et al., Discrete Appl. Math. 216, Part 1, 191--202 (2017; Zbl 1350.05167) Full Text: DOI
Larose, Benoît; Lemaître, Adrien List-homomorphism problems on graphs and arc consistency. (English) Zbl 1281.05069 Discrete Math. 313, No. 22, 2525-2537 (2013). MSC: 05C20 05C70 05C15 PDFBibTeX XMLCite \textit{B. Larose} and \textit{A. Lemaître}, Discrete Math. 313, No. 22, 2525--2537 (2013; Zbl 1281.05069) Full Text: DOI
Loten, Cynthia Absolute retracts and varieties generated by chordal graphs. (English) Zbl 1219.05156 Discrete Math. 310, No. 10-11, 1507-1519 (2010). MSC: 05C75 PDFBibTeX XMLCite \textit{C. Loten}, Discrete Math. 310, No. 10--11, 1507--1519 (2010; Zbl 1219.05156) Full Text: DOI
Nešetřil, Jaroslav A surprising permanence of old motivations (a not-so-rigid story). (English) Zbl 1183.01032 Discrete Math. 309, No. 18, 5510-5526 (2009). Reviewer: Antonín Slavík (Praha) MSC: 01A70 05-02 05-03 05C75 PDFBibTeX XMLCite \textit{J. Nešetřil}, Discrete Math. 309, No. 18, 5510--5526 (2009; Zbl 1183.01032) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav Colouring, constraint satisfaction, and complexity. (English) Zbl 1302.68251 Comput. Sci. Rev. 2, No. 3, 143-163 (2008). MSC: 68T20 05C15 68Q25 68-02 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Comput. Sci. Rev. 2, No. 3, 143--163 (2008; Zbl 1302.68251) Full Text: DOI
Larrión, F.; Pizaña, M. A.; Villarroel-Flores, R. Posets, clique graphs and their homotopy type. (English) Zbl 1127.05073 Eur. J. Comb. 29, No. 1, 334-342 (2008). Reviewer: Dana Piciu (Craiova) MSC: 05C69 06A07 55P10 PDFBibTeX XMLCite \textit{F. Larrión} et al., Eur. J. Comb. 29, No. 1, 334--342 (2008; Zbl 1127.05073) Full Text: DOI
Groshaus, Marina; Szwarcfiter, Jayme L. Biclique-Helly graphs. (English) Zbl 1140.05314 Graphs Comb. 23, No. 6, 633-645 (2007). MSC: 05C62 05C85 PDFBibTeX XMLCite \textit{M. Groshaus} and \textit{J. L. Szwarcfiter}, Graphs Comb. 23, No. 6, 633--645 (2007; Zbl 1140.05314) Full Text: DOI
Dias, Vânia M. F.; de Figueiredo, Celina M. H.; Szwarcfiter, Jayme L. On the generation of bicliques of a graph. (English) Zbl 1126.05074 Discrete Appl. Math. 155, No. 14, 1826-1832 (2007). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{V. M. F. Dias} et al., Discrete Appl. Math. 155, No. 14, 1826--1832 (2007; Zbl 1126.05074) Full Text: DOI
Vikas, Narayan A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. (English) Zbl 1101.68613 J. Comput. Syst. Sci. 71, No. 4, 406-439 (2005). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{N. Vikas}, J. Comput. Syst. Sci. 71, No. 4, 406--439 (2005; Zbl 1101.68613) Full Text: DOI
Dias, Vânia M. F.; de Figueiredo, Celina M. H.; Szwarcfiter, Jayme L. Generating bicliques of a graph in lexicographic order. (English) Zbl 1076.68048 Theor. Comput. Sci. 337, No. 1-3, 240-248 (2005). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C85 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{V. M. F. Dias} et al., Theor. Comput. Sci. 337, No. 1--3, 240--248 (2005; Zbl 1076.68048) Full Text: DOI
Vikas, Narayan Computational complexity of compaction to irreflexive cycles. (English) Zbl 1069.68053 J. Comput. Syst. Sci. 68, No. 3, 473-496 (2004). MSC: 68Q17 05C15 05C38 68R10 PDFBibTeX XMLCite \textit{N. Vikas}, J. Comput. Syst. Sci. 68, No. 3, 473--496 (2004; Zbl 1069.68053) Full Text: DOI
Kabil, Mustapha; Pouzet, Maurice Injective envelope of graphs and transition systems. (English) Zbl 0955.05105 Discrete Math. 192, No. 1-3, 145-186 (1998). MSC: 05C99 08B30 PDFBibTeX XMLCite \textit{M. Kabil} and \textit{M. Pouzet}, Discrete Math. 192, No. 1--3, 145--186 (1998; Zbl 0955.05105) Full Text: DOI
Feder, Tomas; Hell, Pavol List homomorphisms to reflexive graphs. (English) Zbl 0904.05078 J. Comb. Theory, Ser. B 72, No. 2, 236-250 (1998). Reviewer: P.Hell (Burnaby, BC) MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, J. Comb. Theory, Ser. B 72, No. 2, 236--250 (1998; Zbl 0904.05078) Full Text: DOI
Dragan, Feodor F.; Voloshin, Vitaly I. Incidence graphs of biacyclic hypergraphs. (English) Zbl 0863.05060 Discrete Appl. Math. 68, No. 3, 259-266 (1996). Reviewer: A.Brandstädt (Rostock) MSC: 05C65 05C75 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{V. I. Voloshin}, Discrete Appl. Math. 68, No. 3, 259--266 (1996; Zbl 0863.05060) Full Text: DOI Link
Brandstädt, Andreas; Dragan, Feodor F.; Chepoi, Victor D.; Voloshin, Vitaly I. Dually chordal graphs. (English) Zbl 1528.68278 van Leeuwen, Jan (ed.), WG ’93. Graph-theoretic concepts in computer science, 19th international workshop, Utrecht, the Netherlands, June 16–18, 1993. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 790, 237-251 (1994). MSC: 68R10 05C65 05C75 68P15 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Lect. Notes Comput. Sci. 790, 237--251 (1994; Zbl 1528.68278) Full Text: DOI