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
Nascimento, Julliano R.; Souza, Uéverton S.; Szwarcfiter, Jayme L. Partitioning a graph into complementary subgraphs. (English) Zbl 1469.05144 Graphs Comb. 37, No. 4, 1311-1331 (2021). MSC: 05C70 05C60 PDFBibTeX XMLCite \textit{J. R. Nascimento} et al., Graphs Comb. 37, No. 4, 1311--1331 (2021; Zbl 1469.05144) Full Text: DOI
Shalu, M. A.; Vijayakumar, S.; Sandhya, T. P. On the complexity of cd-coloring of graphs. (English) Zbl 1439.05093 Discrete Appl. Math. 280, 171-185 (2020). MSC: 05C15 05C69 PDFBibTeX XMLCite \textit{M. A. Shalu} et al., Discrete Appl. Math. 280, 171--185 (2020; Zbl 1439.05093) Full Text: DOI
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
Talmon, Nimrod Structured proportional representation. (English) Zbl 1408.91067 Theor. Comput. Sci. 708, 58-74 (2018). MSC: 91B12 05C85 68Q17 PDFBibTeX XMLCite \textit{N. Talmon}, Theor. Comput. Sci. 708, 58--74 (2018; Zbl 1408.91067) 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
Kolay, Sudeshna; Panolan, Fahad; Saurabh, Saket Communication complexity of pairs of graph families with applications. (English) Zbl 1441.68052 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 13, 13 p. (2017). MSC: 68Q11 68Q27 68R10 PDFBibTeX XMLCite \textit{S. Kolay} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 13, 13 p. (2017; Zbl 1441.68052) Full Text: DOI
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
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
Brandstädt, Andreas; Esposito, Simone; Nogueira, Loana T.; Protti, Fábio Clique cycle-transversals in distance-hereditary graphs. (English) Zbl 1339.05084 Discrete Appl. Math. 210, 38-44 (2016). MSC: 05C12 05C38 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Appl. Math. 210, 38--44 (2016; Zbl 1339.05084) Full Text: DOI arXiv
Shalu, M. A.; Sandhya, T. P. The cd-coloring of graphs. (English) Zbl 1437.05078 Govindarajan, Sathish (ed.) et al., Algorithms and discrete applied mathematics. Second international conference, CALDAM 2016, Thiruvananthapuram, India, February 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9602, 337-348 (2016). MSC: 05C15 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{M. A. Shalu} and \textit{T. P. Sandhya}, Lect. Notes Comput. Sci. 9602, 337--348 (2016; Zbl 1437.05078) Full Text: DOI
Watrigant, Rémi; Bougeret, Marin; Giroudeau, Rodolphe; König, Jean-Claude On the sum-max graph partitioning problem. (English) Zbl 1418.68108 Theor. Comput. Sci. 540-541, 143-155 (2014). MSC: 68Q25 05C70 68W25 90C27 PDFBibTeX XMLCite \textit{R. Watrigant} et al., Theor. Comput. Sci. 540--541, 143--155 (2014; Zbl 1418.68108) 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
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
Monti, A.; Sinaimeri, B. Rainbow graph splitting. (English) Zbl 1225.68137 Theor. Comput. Sci. 412, No. 39, 5315-5324 (2011). MSC: 68R10 68Q25 05C15 05C70 PDFBibTeX XMLCite \textit{A. Monti} and \textit{B. Sinaimeri}, Theor. Comput. Sci. 412, No. 39, 5315--5324 (2011; Zbl 1225.68137) Full Text: DOI
Nascimento, Mariá C. V.; Carvalho, André C. P. L. F. A graph clustering algorithm based on a clustering coefficient for weighted graphs. (English) Zbl 1214.68263 J. Braz. Comput. Soc. 17, No. 1, 19-29 (2011). MSC: 68R10 05C22 05C85 68T05 68T10 PDFBibTeX XMLCite \textit{M. C. V. Nascimento} and \textit{A. C. P. L. F. Carvalho}, J. Braz. Comput. Soc. 17, No. 1, 19--29 (2011; Zbl 1214.68263) 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
Nešetřil, Jaroslav Many facets of dualities. (English) Zbl 1359.05060 Cook, William J. (ed.) et al., Research trends in combinatorial optimization. Papers based on the presentations at the workshop Bonn, Germany, 2008. Dedicated to Bernard Korte on the occasion of the 70th birthday. Berlin: Springer (ISBN 978-3-540-76795-4/hbk). 285-302 (2009). MSC: 05C25 PDFBibTeX XMLCite \textit{J. Nešetřil}, in: Research trends in combinatorial optimization. Papers based on the presentations at the workshop Bonn, Germany, 2008. Dedicated to Bernard Korte on the occasion of the 70th birthday. Berlin: Springer. 285--302 (2009; Zbl 1359.05060) Full Text: DOI
Zhao, Yingchao; Teng, Shang-Hua Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces. (English) Zbl 1167.90019 Theor. Comput. Sci. 410, No. 11, 1081-1092 (2009). MSC: 90C27 68R10 PDFBibTeX XMLCite \textit{Y. Zhao} and \textit{S.-H. Teng}, Theor. Comput. Sci. 410, No. 11, 1081--1092 (2009; Zbl 1167.90019) 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
Kun, Gábor; Nešetřil, Jaroslav Forbidden lifts (NP and CSP for combinatorialists). (English) Zbl 1213.68323 Eur. J. Comb. 29, No. 4, 930-945 (2008). MSC: 68Q19 03C13 05C15 68Q15 PDFBibTeX XMLCite \textit{G. Kun} and \textit{J. Nešetřil}, Eur. J. Comb. 29, No. 4, 930--945 (2008; Zbl 1213.68323) Full Text: DOI arXiv
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
Kun, Gábor; Nešetřil, Jaroslav NP for combinatorialists. (English) Zbl 1341.05100 Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 373-381 (2007). MSC: 05C20 05C15 68Q17 68Q15 PDFBibTeX XMLCite \textit{G. Kun} and \textit{J. Nešetřil}, Electron. Notes Discrete Math. 29, 373--381 (2007; Zbl 1341.05100) Full Text: DOI
Li, Xueliang; Zhang, Xiaoyan On the minimum monochromatic or multicolored subgraph partition problems. (English) Zbl 1124.68079 Theor. Comput. Sci. 385, No. 1-3, 1-10 (2007). MSC: 68R10 05C85 68W25 PDFBibTeX XMLCite \textit{X. Li} and \textit{X. Zhang}, Theor. Comput. Sci. 385, No. 1--3, 1--10 (2007; Zbl 1124.68079) Full Text: DOI
Jin, Zemin; Kano, Mikio; Li, Xueliang; Wei, Bing Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. (English) Zbl 1137.05057 J. Comb. Optim. 11, No. 4, 445-454 (2006). MSC: 05C70 05C85 90C35 05C15 05C38 05C05 PDFBibTeX XMLCite \textit{Z. Jin} et al., J. Comb. Optim. 11, No. 4, 445--454 (2006; Zbl 1137.05057) 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
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
De Souza Francisco, Raquel; Klein, Sulamita; Nogueira, Loana Tito Characterizing (\(k,l\)) - partitionable cographs. (English) Zbl 1200.05169 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 277-280 (2005). MSC: 05C70 05C69 PDFBibTeX XMLCite \textit{R. De Souza Francisco} et al., Electron. Notes Discrete Math. 22, 277--280 (2005; Zbl 1200.05169) Full Text: DOI
Campos, C. N.; Dantas, S.; Faria, L.; Gravier, S. \(2K_{2}\)-partition problem. (English) Zbl 1200.05166 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 217-221 (2005). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{C. N. Campos} et al., Electron. Notes Discrete Math. 22, 217--221 (2005; Zbl 1200.05166) Full Text: DOI
Trotignon, Nicolas On the structure of self-complementary graphs. (English) Zbl 1182.05103 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 79-82 (2005). MSC: 05C75 PDFBibTeX XMLCite \textit{N. Trotignon}, Electron. Notes Discrete Math. 22, 79--82 (2005; Zbl 1182.05103) Full Text: DOI arXiv
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
Hell, P.; Klein, S.; Nogueira, L. T.; Protti, F. Packing \(r\)-cliques in weighted chordal graphs. (English) Zbl 1091.90073 Ann. Oper. Res. 138, 179-187 (2005). MSC: 90C35 05C85 PDFBibTeX XMLCite \textit{P. Hell} et al., Ann. Oper. Res. 138, 179--187 (2005; Zbl 1091.90073) 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
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
Farrugia, Alastair; Mihók, Peter; Richter, R. Bruce; Semanišin, Gabriel Factorizations and characterizations of induced-hereditary and compositive properties. (English) Zbl 1067.05057 J. Graph Theory 49, No. 1, 11-27 (2005). MSC: 05C70 05C75 PDFBibTeX XMLCite \textit{A. Farrugia} et al., J. Graph Theory 49, No. 1, 11--27 (2005; Zbl 1067.05057) Full Text: DOI arXiv
Dantas, Simone; de Figueiredo, Celina M. H.; Faria, Luerbio On decision and optimization (\(k\),\(l\))-graph sandwich problems. (English) Zbl 1102.68091 Discrete Appl. Math. 143, No. 1-3, 155-165 (2004). MSC: 68R10 68Q17 05C69 PDFBibTeX XMLCite \textit{S. Dantas} et al., Discrete Appl. Math. 143, No. 1--3, 155--165 (2004; Zbl 1102.68091) Full Text: DOI
Dantas, Simone; de Figueiredo, Celina M. H.; Klein, Sulamita; Gravier, Sylvain; Reed, Bruce A. Stable skew partition problem. (English) Zbl 1053.05058 Discrete Appl. Math. 143, No. 1-3, 17-22 (2004). MSC: 05C17 05A17 68R10 68Q25 PDFBibTeX XMLCite \textit{S. Dantas} et al., Discrete Appl. Math. 143, No. 1--3, 17--22 (2004; Zbl 1053.05058) Full Text: DOI
Hell, Pavol; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio Partitioning chordal graphs into independent sets and cliques. (English) Zbl 1043.05097 Discrete Appl. Math. 141, No. 1-3, 185-194 (2004). MSC: 05C70 05C69 05C85 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 141, No. 1--3, 185--194 (2004; Zbl 1043.05097) Full Text: DOI
Brandstädt, Andreas; Dragan, Feodor F.; Le, Van Bang; Szymczak, Thomas On stable cutsets in graphs. (English) Zbl 0962.68138 Discrete Appl. Math. 105, No. 1-3, 39-50 (2000). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Appl. Math. 105, No. 1--3, 39--50 (2000; Zbl 0962.68138) Full Text: DOI