Chudnovsky, Maria; Huang, Shenwei; Rzążewski, Paweł; Spirkl, Sophie; Zhong, Mingxian Complexity of \(C_k\)-coloring in hereditary classes of graphs. (English) Zbl 07687210 Inf. Comput. 292, Article ID 105015, 19 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Inf. Comput. 292, Article ID 105015, 19 p. (2023; Zbl 07687210) Full Text: DOI
Alves, Sancrey R.; Couto, Fernanda; Faria, Luerbio; Gravier, Sylvain; Klein, Sulamita; Souza, Uéverton S. Partitions and well-coveredness: the graph sandwich problem. (English) Zbl 1506.05166 Discrete Math. 346, No. 3, Article ID 113253, 10 p. (2023). MSC: 05C70 05C69 68Q17 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Discrete Math. 346, No. 3, Article ID 113253, 10 p. (2023; Zbl 1506.05166) Full Text: DOI
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
Bhyravarapu, Sriram; Jana, Satyabrata; Panolan, Fahad; Saurabh, Saket; Verma, Shaily List homomorphism: beyond the known boundaries. (English) Zbl 07719369 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 593-609 (2022). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{S. Bhyravarapu} et al., Lect. Notes Comput. Sci. 13568, 593--609 (2022; Zbl 07719369) Full Text: DOI
Faria, Luerbio; Souza, Uéverton S. On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity. (English) Zbl 07585795 Theor. Comput. Sci. 932, 56-68 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. Faria} and \textit{U. S. Souza}, Theor. Comput. Sci. 932, 56--68 (2022; Zbl 07585795) Full Text: DOI
Alves, Matheus S. D.; Nascimento, Julliano R.; Souza, Uéverton S. On the complexity of coloring \(( r , \ell )\)-graphs. (English) Zbl 07769642 Int. Trans. Oper. Res. 28, No. 6, 3172-3189 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{M. S. D. Alves} et al., Int. Trans. Oper. Res. 28, No. 6, 3172--3189 (2021; Zbl 07769642) Full Text: DOI
Faria, Luerbio; Souza, Uéverton S. On the probe problem for \((r,\ell )\)-well-coveredness. (English) Zbl 07670478 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 375-386 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{L. Faria} and \textit{U. S. Souza}, Lect. Notes Comput. Sci. 13025, 375--386 (2021; Zbl 07670478) Full Text: DOI
Chudnovsky, Maria; Huang, Shenwei; Rzążewski, Paweł; Spirkl, Sophie; Zhong, Mingxian Complexity of \(C_K\)-coloring in hereditary classes of graphs. (English) Zbl 07525468 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 31, 15 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 31, 15 p. (2019; Zbl 07525468) Full Text: DOI arXiv
Bonomo, Flavia; de Estrada, Diego On the thinness and proper thinness of a graph. (English) Zbl 1410.05155 Discrete Appl. Math. 261, 78-92 (2019). MSC: 05C69 PDFBibTeX XMLCite \textit{F. Bonomo} and \textit{D. de Estrada}, Discrete Appl. Math. 261, 78--92 (2019; Zbl 1410.05155) 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
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. (English) Zbl 1400.68078 Theor. Comput. Sci. 746, 36-48 (2018). MSC: 68Q25 05C70 68Q17 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Theor. Comput. Sci. 746, 36--48 (2018; Zbl 1400.68078) 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
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; dos Santos Souza, Uéverton On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. (English) Zbl 1483.68247 Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 423-437 (2016). MSC: 68R10 05C69 05C70 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Lect. Notes Comput. Sci. 10043, 423--437 (2016; Zbl 1483.68247) Full Text: DOI arXiv Link
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
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
Hell, Pavol Graph partitions with prescribed patterns. (English) Zbl 1292.05214 Eur. J. Comb. 35, 335-353 (2014). MSC: 05C70 05C69 05C15 05C50 PDFBibTeX XMLCite \textit{P. Hell}, Eur. J. Comb. 35, 335--353 (2014; Zbl 1292.05214) Full Text: DOI
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
Feder, Tomás; Hell, Pavol; Nekooei Rizi, Shekoofeh Obstructions to partitions of chordal graphs. (English) Zbl 1277.05137 Discrete Math. 313, No. 19, 1861-1871 (2013). MSC: 05C70 05C60 05C17 68Q17 68Q25 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Math. 313, No. 19, 1861--1871 (2013; Zbl 1277.05137) Full Text: DOI
Feder, Tomás; Hell, Pavol; Schell, David G.; Stacho, Juraj Dichotomy for tree-structured trigraph list homomorphism problems. (English) Zbl 1223.05095 Discrete Appl. Math. 159, No. 12, 1217-1224 (2011). MSC: 05C20 05C15 05C05 05C60 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 159, No. 12, 1217--1224 (2011; Zbl 1223.05095) Full Text: DOI arXiv
Teixeira, Rafael B.; Dantas, Simone; de Figueiredo, Celina M. H. The external constraint 4 nonempty part sandwich problem. (English) Zbl 1213.05254 Discrete Appl. Math. 159, No. 7, 661-673 (2011). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{R. B. Teixeira} et al., Discrete Appl. Math. 159, No. 7, 661--673 (2011; Zbl 1213.05254) Full Text: DOI
Cook, Kathryn; Dantas, Simone; Eschen, Elaine M.; Faria, Luerbio; de Figueiredo, Celina M. H.; Klein, Sulamita \(2K_{2}\) vertex-set partition into nonempty parts. (English) Zbl 1230.05233 Discrete Math. 310, No. 6-7, 1259-1264 (2010). MSC: 05C70 05A18 05C85 68Q17 PDFBibTeX XMLCite \textit{K. Cook} et al., Discrete Math. 310, No. 6--7, 1259--1264 (2010; Zbl 1230.05233) 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
Ekim, Tınaz; Hell, Pavol; Stacho, Juraj; De Werra, Dominique Polarity of chordal graphs. (English) Zbl 1163.05051 Discrete Appl. Math. 156, No. 13, 2469-2479 (2008). MSC: 05C85 68N30 05C35 PDFBibTeX XMLCite \textit{T. Ekim} et al., Discrete Appl. Math. 156, No. 13, 2469--2479 (2008; Zbl 1163.05051) Full Text: DOI
Dantas, Simone; Eschen, Elaine M.; Faria, Luerbio; De Figueiredo, Celina M. H.; Klein, Sulamita \(2K_2\) vertex-set partition into nonempty parts. (English) Zbl 1341.05205 Liebling, Th. (ed.) et al., The IV Latin-American algorithms, graphs, and optimization symposium, Puerto Varas, Chile, November 25–29, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 30, 291-296 (2008). MSC: 05C70 05A18 05C10 68W40 68Q17 PDFBibTeX XMLCite \textit{S. Dantas} et al., Electron. Notes Discrete Math. 30, 291--296 (2008; Zbl 1341.05205) Full Text: DOI
Stacho, Juraj On 2-subcolourings of chordal graphs. (English) Zbl 1136.68470 Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 544-554 (2008). MSC: 68R10 05C15 68Q25 PDFBibTeX XMLCite \textit{J. Stacho}, Lect. Notes Comput. Sci. 4957, 544--554 (2008; Zbl 1136.68470) Full Text: DOI
Hell, Pavol; Raspaud, André; Stacho, Juraj On injective colourings of chordal graphs. (English) Zbl 1136.68463 Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 520-530 (2008). MSC: 68R10 05C15 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. Hell} et al., Lect. Notes Comput. Sci. 4957, 520--530 (2008; Zbl 1136.68463) Full Text: DOI
Feder, Tomás; Hell, Pavol On realizations of point determining graphs, and obstructions to full homomorphisms. (English) Zbl 1135.05042 Discrete Math. 308, No. 9, 1639-1652 (2008). MSC: 05C62 05C15 05C60 05C75 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, Discrete Math. 308, No. 9, 1639--1652 (2008; Zbl 1135.05042) Full Text: DOI
Feder, Tomás; Hell, Pavol; Xie, Wing Matrix partitions with finitely many obstructions. (English) Zbl 1158.05325 Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 371-378 (2007). MSC: 05C50 15A99 05C75 PDFBibTeX XMLCite \textit{T. Feder} et al., Electron. Notes Discrete Math. 28, 371--378 (2007; Zbl 1158.05325) Full Text: DOI
Feder, Tomás; Hell, Pavol; Tucker-Nally, Kim Digraph matrix partitions and trigraph homomorphisms. (English) Zbl 1106.05060 Discrete Appl. Math. 154, No. 17, 2458-2469 (2006). MSC: 05C50 05C20 05C15 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 154, No. 17, 2458--2469 (2006; Zbl 1106.05060) Full Text: DOI
Feder, Tomás; Hell, Pavol Matrix partitions of perfect graphs. (English) Zbl 1143.05035 Discrete Math. 306, No. 19-20, 2450-2460 (2006). Reviewer: Bert Randerath (Köln) MSC: 05C17 05C15 68R10 05C85 05C50 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, Discrete Math. 306, No. 19--20, 2450--2460 (2006; Zbl 1143.05035) Full Text: DOI