Bonomo-Braberman, Flavia; Brettell, Nick; Munaro, Andrea; Paulusma, Daniël Solving problems on generalized convex graphs via mim-width. (English) Zbl 07783118 J. Comput. Syst. Sci. 140, Article ID 103493, 15 p. (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., J. Comput. Syst. Sci. 140, Article ID 103493, 15 p. (2024; Zbl 07783118) Full Text: DOI
Aliaj, Jurgen; Molloy, Michael Adaptable and conflict colouring multigraphs with no cycles of length three or four. (English) Zbl 1522.05088 J. Graph Theory 104, No. 1, 188-219 (2023). MSC: 05C15 05D40 PDFBibTeX XMLCite \textit{J. Aliaj} and \textit{M. Molloy}, J. Graph Theory 104, No. 1, 188--219 (2023; Zbl 1522.05088) Full Text: DOI arXiv OA License
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
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
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. (English) Zbl 1522.05362 J. Graph Theory 98, No. 1, 81-109 (2021). MSC: 05C70 05C62 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Graph Theory 98, No. 1, 81--109 (2021; Zbl 1522.05362) Full Text: DOI arXiv OA License
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
Contreras-Mendoza, F. Esteban; Hernández-Cruz, César Minimal obstructions to \(( \infty , k )\)-polarity in cographs. (English) Zbl 1466.05140 Discrete Math. 344, No. 7, Article ID 112407, 13 p. (2021). MSC: 05C62 05C70 PDFBibTeX XMLCite \textit{F. E. Contreras-Mendoza} and \textit{C. Hernández-Cruz}, Discrete Math. 344, No. 7, Article ID 112407, 13 p. (2021; Zbl 1466.05140) 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
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
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M. Subgraph complementation. (English) Zbl 1439.05212 Algorithmica 82, No. 7, 1859-1880 (2020). MSC: 05C85 05C75 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 82, No. 7, 1859--1880 (2020; Zbl 1439.05212) Full Text: DOI arXiv
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
Chudnovsky, Maria; de Figueiredo, Celina M. H.; Spirkl, Sophie The sandwich problem for decompositions and almost monotone properties. (English) Zbl 1397.05186 Algorithmica 80, No. 12, 3618-3645 (2018). MSC: 05C85 05C70 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Algorithmica 80, No. 12, 3618--3645 (2018; Zbl 1397.05186) 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; 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
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Recognizing graphs close to bipartite graphs. (English) Zbl 1441.68167 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 70, 14 p. (2017). MSC: 68R10 05C15 05C70 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Bonamy} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 70, 14 p. (2017; Zbl 1441.68167) 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
Baste, Julien; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi Parameterized complexity dichotomy for \((r, \ell)\)-Vertex Deletion. (English) Zbl 1378.68057 Theory Comput. Syst. 61, No. 3, 777-794 (2017). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{J. Baste} et al., Theory Comput. Syst. 61, No. 3, 777--794 (2017; Zbl 1378.68057) Full Text: DOI arXiv
Shalu, M. A.; Devi Yamini, S. One-three join: a graph operation and its consequences. (English) Zbl 1366.05089 Discuss. Math., Graph Theory 37, No. 3, 633-647 (2017). MSC: 05C75 05C76 PDFBibTeX XMLCite \textit{M. A. Shalu} and \textit{S. Devi Yamini}, Discuss. Math., Graph Theory 37, No. 3, 633--647 (2017; Zbl 1366.05089) 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
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
Dyer, Martin; Goldberg, Leslie Ann; Richerby, David Counting \(4 \times 4\) matrix partitions of graphs. (English) Zbl 1344.05113 Discrete Appl. Math. 213, 76-92 (2016). MSC: 05C70 05C30 PDFBibTeX XMLCite \textit{M. Dyer} et al., Discrete Appl. Math. 213, 76--92 (2016; Zbl 1344.05113) Full Text: DOI arXiv
Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki Counting list matrix partitions of graphs. (English) Zbl 1329.68139 SIAM J. Comput. 44, No. 4, 1089-1118 (2015). MSC: 68Q25 05C30 05C50 68Q17 PDFBibTeX XMLCite \textit{A. Göbel} et al., SIAM J. Comput. 44, No. 4, 1089--1118 (2015; Zbl 1329.68139) Full Text: DOI arXiv
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
Chudnovsky, Maria; Norin, Sergey; Reed, Bruce; Seymour, Paul Excluding a substar and an antisubstar. (English) Zbl 1408.05090 SIAM J. Discrete Math. 29, No. 1, 297-308 (2015). MSC: 05C60 05C55 05C69 05D10 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., SIAM J. Discrete Math. 29, No. 1, 297--308 (2015; Zbl 1408.05090) Full Text: DOI Link
Martin, Barnaby; Paulusma, Daniël The computational complexity of disconnected cut and \(2 K_2\)-partition. (English) Zbl 1307.05128 J. Comb. Theory, Ser. B 111, 17-37 (2015). MSC: 05C40 05C60 05C70 68Q17 PDFBibTeX XMLCite \textit{B. Martin} and \textit{D. Paulusma}, J. Comb. Theory, Ser. B 111, 17--37 (2015; Zbl 1307.05128) Full Text: DOI
Dabrowski, Konrad K.; Lozin, Vadim V.; Stacho, Juraj Stable-\(\Pi\) partitions of graphs. (English) Zbl 1306.05189 Discrete Appl. Math. 182, 104-114 (2015). MSC: 05C70 05C75 68Q17 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Discrete Appl. Math. 182, 104--114 (2015; Zbl 1306.05189) Full Text: DOI
Chat, Bilal A.; Pirzada, Shariefuddin; Iványi, Antal Recognition of split-graphic sequences. (English) Zbl 1306.05097 Acta Univ. Sapientiae, Inform. 6, No. 2, 252-286 (2014). MSC: 05C30 05C50 PDFBibTeX XMLCite \textit{B. A. Chat} et al., Acta Univ. Sapientiae, Inform. 6, No. 2, 252--286 (2014; Zbl 1306.05097) Full Text: DOI
Habib, Michel; Mamcarz, Antoine; de Montgolfier, Fabien Computing \(H\)-joins with application to 2-modular decomposition. (English) Zbl 1306.05235 Algorithmica 70, No. 2, 245-266 (2014). MSC: 05C85 PDFBibTeX XMLCite \textit{M. Habib} et al., Algorithmica 70, No. 2, 245--266 (2014; Zbl 1306.05235) Full Text: DOI
Bousquet, N.; Lagoutte, A.; Thomassé, S. Clique versus independent set. (English) Zbl 1297.05173 Eur. J. Comb. 40, 73-92 (2014). MSC: 05C69 68Q25 PDFBibTeX XMLCite \textit{N. Bousquet} et al., Eur. J. Comb. 40, 73--92 (2014; Zbl 1297.05173) 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
Campos, Victor; Klein, Sulamita; Sampaio, Rudini; Silva, Ana Fixed-parameter algorithms for the cocoloring problem. (English) Zbl 1284.05093 Discrete Appl. Math. 167, 52-60 (2014). MSC: 05C15 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{V. Campos} et al., Discrete Appl. Math. 167, 52--60 (2014; Zbl 1284.05093) 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
Vikas, Narayan Algorithms for partition of some class of graphs under compaction and vertex-compaction. (English) Zbl 1275.05057 Algorithmica 67, No. 2, 180-206 (2013). MSC: 05C85 05C70 68Q17 PDFBibTeX XMLCite \textit{N. Vikas}, Algorithmica 67, No. 2, 180--206 (2013; Zbl 1275.05057) Full Text: DOI
Molloy, Michael; Thron, Giovanna An asymptotically tight bound on the adaptable chromatic number. (English) Zbl 1283.05107 J. Graph Theory 71, No. 3-4, 331-351 (2012). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{M. Molloy} and \textit{G. Thron}, J. Graph Theory 71, No. 3--4, 331--351 (2012; Zbl 1283.05107) Full Text: DOI
de Figueiredo, Celina M. H. The P versus NP-complete dichotomy of some challenging problems in graph theory. (English) Zbl 1253.68268 Discrete Appl. Math. 160, No. 18, 2681-2693 (2012). MSC: 68R10 68Q17 68Q25 68W40 05C85 05C62 PDFBibTeX XMLCite \textit{C. M. H. de Figueiredo}, Discrete Appl. Math. 160, No. 18, 2681--2693 (2012; Zbl 1253.68268) Full Text: DOI
Dantas, Simone; Maffray, Frédéric; Silva, Ana \(2K_2\)-partition of some classes of graphs. (English) Zbl 1254.05153 Discrete Appl. Math. 160, No. 18, 2662-2668 (2012). MSC: 05C70 PDFBibTeX XMLCite \textit{S. Dantas} et al., Discrete Appl. Math. 160, No. 18, 2662--2668 (2012; Zbl 1254.05153) Full Text: DOI
Darlay, Julien; Brauner, Nadia; Moncel, Julien Dense and sparse graph partition. (English) Zbl 1252.05172 Discrete Appl. Math. 160, No. 16-17, 2389-2396 (2012). MSC: 05C70 05C42 05C40 05C82 PDFBibTeX XMLCite \textit{J. Darlay} et al., Discrete Appl. Math. 160, No. 16--17, 2389--2396 (2012; Zbl 1252.05172) Full Text: DOI
Bodirsky, Manuel; Kára, Jan; Martin, Barnaby The complexity of surjective homomorphism problems-a survey. (English) Zbl 1246.05104 Discrete Appl. Math. 160, No. 12, 1680-1690 (2012). MSC: 05C60 68Q17 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Discrete Appl. Math. 160, No. 12, 1680--1690 (2012; Zbl 1246.05104) Full Text: DOI
Kierstead, H. A.; Yang, Chung-Ying; Yang, Daqing; Zhu, Xuding Adapted game colouring of graphs. (English) Zbl 1239.05069 Eur. J. Comb. 33, No. 4, 435-445 (2012). MSC: 05C15 05C57 PDFBibTeX XMLCite \textit{H. A. Kierstead} et al., Eur. J. Comb. 33, No. 4, 435--445 (2012; Zbl 1239.05069) Full Text: DOI
LaMar, M. Drew Split digraphs. (English) Zbl 1241.05116 Discrete Math. 312, No. 7, 1314-1325 (2012). MSC: 05C70 05C20 05C07 PDFBibTeX XMLCite \textit{M. D. LaMar}, Discrete Math. 312, No. 7, 1314--1325 (2012; Zbl 1241.05116) Full Text: DOI arXiv Link
Ito, Takehiro; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Parameterizing cut sets in a graph by the number of their components. (English) Zbl 1232.05115 Theor. Comput. Sci. 412, No. 45, 6340-6350 (2011). MSC: 05C40 68Q17 PDFBibTeX XMLCite \textit{T. Ito} et al., Theor. Comput. Sci. 412, No. 45, 6340--6350 (2011; Zbl 1232.05115) Full Text: DOI
Molloy, Michael; Thron, Giovanna The adaptable choosability number grows with the choosability number. (English) Zbl 1250.05049 Discrete Math. 311, No. 20, 2268-2271 (2011). Reviewer: Ulrike Baumann (Dresden) MSC: 05C15 05C78 PDFBibTeX XMLCite \textit{M. Molloy} and \textit{G. Thron}, Discrete Math. 311, No. 20, 2268--2271 (2011; Zbl 1250.05049) 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
Bravo, Raquel S. F.; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques. (English) Zbl 1210.05106 Discrete Appl. Math. 159, No. 4, 165-173 (2011). MSC: 05C70 PDFBibTeX XMLCite \textit{R. S. F. Bravo} et al., Discrete Appl. Math. 159, No. 4, 165--173 (2011; Zbl 1210.05106) Full Text: DOI
Teixeira, Rafael B.; Dantas, Simone; de Figueiredo, Celina M. H. The polynomial dichotomy for three nonempty part sandwich problems. (English) Zbl 1209.05191 Discrete Appl. Math. 158, No. 12, 1286-1304 (2010). MSC: 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{R. B. Teixeira} et al., Discrete Appl. Math. 158, No. 12, 1286--1304 (2010; Zbl 1209.05191) Full Text: DOI
Huang, Jing; Xu, Baogang A forbidden subgraph characterization of line-polar bipartite graphs. (English) Zbl 1225.05201 Discrete Appl. Math. 158, No. 6, 666-680 (2010). MSC: 05C70 PDFBibTeX XMLCite \textit{J. Huang} and \textit{B. Xu}, Discrete Appl. Math. 158, No. 6, 666--680 (2010; Zbl 1225.05201) 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
Ekim, Tınaz; Gimbel, John Partitioning graphs into complete and empty graphs. (English) Zbl 1186.05095 Discrete Math. 309, No. 19, 5849-5856 (2009). MSC: 05C70 PDFBibTeX XMLCite \textit{T. Ekim} and \textit{J. Gimbel}, Discrete Math. 309, No. 19, 5849--5856 (2009; Zbl 1186.05095) Full Text: DOI
Hell, Pavol; Pan, Zhishi; Wong, Tsai-Lien; Zhu, Xuding Adaptable chromatic number of graph products. (English) Zbl 1179.05045 Discrete Math. 309, No. 21, 6153-6159 (2009). MSC: 05C15 05C76 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Math. 309, No. 21, 6153--6159 (2009; Zbl 1179.05045) Full Text: DOI
Montassier, Mickaël; Raspaud, André; Zhu, Xuding An upper bound on adaptable choosability of graphs. (English) Zbl 1209.05094 Eur. J. Comb. 30, No. 2, 351-355 (2009). MSC: 05C15 05C78 05C35 PDFBibTeX XMLCite \textit{M. Montassier} et al., Eur. J. Comb. 30, No. 2, 351--355 (2009; Zbl 1209.05094) 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.; Mahadev, N. V. R.; De Werra, D. Polar cographs. (English) Zbl 1152.05356 Discrete Appl. Math. 156, No. 10, 1652-1660 (2008); corrigendum ibid. 171, 158 (2014). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{T. Ekim} et al., Discrete Appl. Math. 156, No. 10, 1652--1660 (2008; Zbl 1152.05356) Full Text: DOI
Le, Van Bang; Mosca, Raffaele; Müller, Haiko On stable cutsets in claw-free graphs and planar graphs. (English) Zbl 1154.05317 J. Discrete Algorithms 6, No. 2, 256-276 (2008). MSC: 05C35 05C10 05C85 68R10 PDFBibTeX XMLCite \textit{V. B. Le} et al., J. Discrete Algorithms 6, No. 2, 256--276 (2008; Zbl 1154.05317) 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
Teixeira, Rafael B.; Dantas, Simone; de Figueiredo, Celina M. H. The polynomial dichotomy for three nonempty part sandwich problems. (English) Zbl 1341.05240 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, 81-86 (2008). MSC: 05C85 68Q17 05C62 PDFBibTeX XMLCite \textit{R. B. Teixeira} et al., Electron. Notes Discrete Math. 30, 81--86 (2008; Zbl 1341.05240) Full Text: DOI
Hell, Pavol; Zhu, Xuding On the adaptable chromatic number of graphs. (English) Zbl 1147.05031 Eur. J. Comb. 29, No. 4, 912-921 (2008). MSC: 05C15 PDFBibTeX XMLCite \textit{P. Hell} and \textit{X. Zhu}, Eur. J. Comb. 29, No. 4, 912--921 (2008; Zbl 1147.05031) 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
Hell, Pavol; Nešetřil, Jarik On the density of trigraph homomorphisms. (English) Zbl 1120.05091 Graphs Comb. 23, Suppl., 275-281 (2007). Reviewer: William G. Brown (Montréal) MSC: 05C99 05C15 05C17 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Graphs Comb. 23, 275--281 (2007; Zbl 1120.05091) 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
Ekim, Tınaz; Mahadev, N. V. R.; de Werra, Dominique Polar cographs. (English) Zbl 1136.05316 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, 317-323 (2007). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{T. Ekim} et al., Electron. Notes Discrete Math. 28, 317--323 (2007; Zbl 1136.05316) 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
Dantas, Simone; De Figueiredo, Celina M. H.; Gravier, Sylvain; Klein, Sulamita Extended skew partition problem. (English) Zbl 1178.68640 Discrete Math. 306, No. 19-20, 2438-2449 (2006). MSC: 68W05 68P05 PDFBibTeX XMLCite \textit{S. Dantas} et al., Discrete Math. 306, No. 19--20, 2438--2449 (2006; Zbl 1178.68640) Full Text: DOI
Abueida, Atif; Sritharan, R. A note on the recognition of bisplit graphs. (English) Zbl 1099.05063 Discrete Math. 306, No. 17, 2108-2110 (2006). MSC: 05C62 PDFBibTeX XMLCite \textit{A. Abueida} and \textit{R. Sritharan}, Discrete Math. 306, No. 17, 2108--2110 (2006; Zbl 1099.05063) Full Text: DOI
Demange, Marc; Ekim, Tınaz; de Werra, Dominique \((p,k)\)-coloring problems in line graphs. (English) Zbl 1086.05029 Theor. Comput. Sci. 349, No. 3, 462-474 (2005). MSC: 05C15 68Q25 PDFBibTeX XMLCite \textit{M. Demange} et al., Theor. Comput. Sci. 349, No. 3, 462--474 (2005; Zbl 1086.05029) Full Text: DOI
Feder, Tomás; Hell, Pavol; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio List matrix partitions of chordal graphs. (English) Zbl 1084.05026 Theor. Comput. Sci. 349, No. 1, 52-66 (2005). MSC: 05C15 05C70 68Q25 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Theor. Comput. Sci. 349, No. 1, 52--66 (2005; Zbl 1084.05026) 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
Brandstädt, Andreas; Hammer, Peter L.; Le, Van Bang; Lozin, Vadim V. Bisplit graphs. (English) Zbl 1073.05059 Discrete Math. 299, No. 1-3, 11-32 (2005). MSC: 05C75 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Math. 299, No. 1--3, 11--32 (2005; Zbl 1073.05059) Full Text: DOI
Demange, Marc; Ekim, Tınaz; de Werra, Dominique Partitioning cographs into cliques and stable sets. (English) Zbl 1136.05315 Discrete Optim. 2, No. 2, 145-153 (2005). MSC: 05C70 PDFBibTeX XMLCite \textit{M. Demange} et al., Discrete Optim. 2, No. 2, 145--153 (2005; Zbl 1136.05315) Full Text: DOI
Dantas, Simone; de Figueiredo, Celina M. H.; Gravier, Sylvain; Klein, Sulamita Finding \(H\)-partitions efficiently. (English) Zbl 1063.05124 Theor. Inform. Appl. 39, No. 1, 133-144 (2005). Reviewer: Haiko Müller (Leeds) MSC: 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{S. Dantas} et al., Theor. Inform. Appl. 39, No. 1, 133--144 (2005; Zbl 1063.05124) Full Text: DOI Numdam EuDML