Guzmán-Pro, Santiago Full-homomorphisms to paths and cycles. (English) Zbl 07790194 Discrete Math. 347, No. 3, Article ID 113800, 9 p. (2024). MSC: 05C38 05C60 PDFBibTeX XMLCite \textit{S. Guzmán-Pro}, Discrete Math. 347, No. 3, Article ID 113800, 9 p. (2024; Zbl 07790194) Full Text: DOI arXiv
Barsukov, Alexey; Madelaine, Florent R. On guarded extensions of MMSNP. (English) Zbl 07787582 Della Vedova, Gianluca (ed.) et al., Unity of logic and computation. 19th conference on computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13967, 202-213 (2023). MSC: 03B70 68Qxx PDFBibTeX XMLCite \textit{A. Barsukov} and \textit{F. R. Madelaine}, Lect. Notes Comput. Sci. 13967, 202--213 (2023; Zbl 07787582) Full Text: DOI arXiv
García-Altamirano, Juan Carlos; Hernández-Cruz, César Minimal obstructions for a matrix partition problem in chordal graphs. (English) Zbl 1506.05170 Discrete Appl. Math. 324, 58-66 (2023). MSC: 05C70 05C15 05C50 PDFBibTeX XMLCite \textit{J. C. García-Altamirano} and \textit{C. Hernández-Cruz}, Discrete Appl. Math. 324, 58--66 (2023; Zbl 1506.05170) Full Text: DOI arXiv
Martin, Barnaby; Paulusma, Daniël; van Leeuwen, Erik Jan Disconnected cuts in claw-free graphs. (English) Zbl 1450.05073 J. Comput. Syst. Sci. 113, 60-75 (2020). MSC: 05C76 05C70 PDFBibTeX XMLCite \textit{B. Martin} et al., J. Comput. Syst. Sci. 113, 60--75 (2020; Zbl 1450.05073) Full Text: DOI Link
Feder, Tomás; Hell, Pavol Complexity of correspondence \(H\)-colourings. (English) Zbl 1440.05150 Discrete Appl. Math. 281, 235-245 (2020). MSC: 05C60 05C15 68Q17 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, Discrete Appl. Math. 281, 235--245 (2020; Zbl 1440.05150) Full Text: DOI arXiv
Contreras-Mendoza, Fernando Esteban; Hernández-Cruz, César Minimal obstructions to \(( s , 1 )\)-polarity in cographs. (English) Zbl 1440.05165 Discrete Appl. Math. 281, 111-117 (2020). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{F. E. Contreras-Mendoza} and \textit{C. Hernández-Cruz}, Discrete Appl. Math. 281, 111--117 (2020; Zbl 1440.05165) Full Text: DOI arXiv
Benítez-Bobadilla, Germán; Galeana-Sánchez, Hortensia; Hernández-Cruz, César Characterization of color patterns by dynamic \(H\)-paths. (English) Zbl 1420.05065 Discrete Appl. Math. 267, 41-51 (2019). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{G. Benítez-Bobadilla} et al., Discrete Appl. Math. 267, 41--51 (2019; Zbl 1420.05065) Full Text: DOI
Hell, Pavol; Hernández-Cruz, César; Sales, Cláudia Linhares Minimal obstructions to 2-polar cographs. (English) Zbl 1410.05164 Discrete Appl. Math. 261, 219-228 (2019). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 261, 219--228 (2019; Zbl 1410.05164) Full Text: DOI arXiv
Valadkhan, Payam List matrix partitions of graphs representing geometric configurations. (English) Zbl 1409.05165 Discrete Appl. Math. 260, 237-243 (2019). MSC: 05C70 05C62 PDFBibTeX XMLCite \textit{P. Valadkhan}, Discrete Appl. Math. 260, 237--243 (2019; Zbl 1409.05165) Full Text: DOI
Martin, Barnaby; Paulusma, Daniël; van Leeuwen, Erik Jan Disconnected cuts in claw-free graphs. (English) Zbl 1524.05256 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 61, 14 p. (2018). MSC: 05C76 05C40 05C70 68Q25 PDFBibTeX XMLCite \textit{B. Martin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 61, 14 p. (2018; Zbl 1524.05256) 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
Valadkhan, Payam; Davari, Mohammad-Javad The monotonicity property of \(M\)-partition problems. (English) Zbl 1384.05134 Eur. J. Comb. 70, 178-189 (2018). MSC: 05C70 68Q25 PDFBibTeX XMLCite \textit{P. Valadkhan} and \textit{M.-J. Davari}, Eur. J. Comb. 70, 178--189 (2018; Zbl 1384.05134) 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
Valadkhan, Payam The complexity of list edge-partitions for simple graphs. (English) Zbl 1352.05154 Eur. J. Comb. 61, 219-234 (2017). MSC: 05C70 PDFBibTeX XMLCite \textit{P. Valadkhan}, Eur. J. Comb. 61, 219--234 (2017; Zbl 1352.05154) Full Text: DOI
Feder, Tomás; Hell, Pavol; Hernández-Cruz, César Colourings, homomorphisms, and partitions of transitive digraphs. (English) Zbl 1348.05073 Eur. J. Comb. 60, 55-65 (2017). MSC: 05C15 05C20 05C70 PDFBibTeX XMLCite \textit{T. Feder} et al., Eur. J. Comb. 60, 55--65 (2017; Zbl 1348.05073) Full Text: DOI arXiv
Hüffner, Falk; Komusiewicz, Christian; Nichterlein, André Editing graphs into few cliques: complexity, approximation, and kernelization schemes. (English) Zbl 1451.68203 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 410-421 (2015). MSC: 68R10 05C69 68Q17 68Q27 68W25 68W40 PDFBibTeX XMLCite \textit{F. Hüffner} et al., Lect. Notes Comput. Sci. 9214, 410--421 (2015; Zbl 1451.68203) Full Text: DOI
Hell, Pavol; Yen, Pei-Lan Join colourings of chordal graphs. (English) Zbl 1318.05058 Discrete Math. 338, No. 12, 2453-2461 (2015). MSC: 05C70 05C15 05C60 PDFBibTeX XMLCite \textit{P. Hell} and \textit{P.-L. Yen}, Discrete Math. 338, No. 12, 2453--2461 (2015; Zbl 1318.05058) Full Text: DOI
Hell, Pavol; Hernández-Cruz, César Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms. (English) Zbl 1315.05066 Discrete Math. 338, No. 10, 1755-1762 (2015). MSC: 05C20 PDFBibTeX XMLCite \textit{P. Hell} and \textit{C. Hernández-Cruz}, Discrete Math. 338, No. 10, 1755--1762 (2015; Zbl 1315.05066) Full Text: DOI arXiv
Montgomery, Richard Almost all friendly matrices have many obstructions. (English) Zbl 1311.05165 SIAM J. Discrete Math. 29, No. 1, 421-430 (2015). MSC: 05C70 05C15 68R10 68Q17 PDFBibTeX XMLCite \textit{R. Montgomery}, SIAM J. Discrete Math. 29, No. 1, 421--430 (2015; Zbl 1311.05165) Full Text: DOI arXiv
Chen, Hubie An algebraic hardness criterion for surjective constraint satisfaction. (English) Zbl 1308.08001 Algebra Univers. 72, No. 4, 393-401 (2014). Reviewer: Ivan Chajda (Přerov) MSC: 08A70 03C05 68Q17 PDFBibTeX XMLCite \textit{H. Chen}, Algebra Univers. 72, No. 4, 393--401 (2014; Zbl 1308.08001) Full Text: DOI arXiv
Feder, Tomás; Hell, Pavol; Shklarsky, Oren Matrix partitions of split graphs. (English) Zbl 1283.05213 Discrete Appl. Math. 166, 91-96 (2014). MSC: 05C70 05C15 05C50 05C60 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 166, 91--96 (2014; Zbl 1283.05213) Full Text: DOI arXiv