A characterization of graphs without long induced paths. - Gábor Bacsó; Zsolt Tuza (J. Graph Theory, 1990)

Domination properties and induced subgraphs. - Gábor Bacsó; Zsolt Tuza (Discret. Math., 1993)

On a conjecture about uniquely colorable perfect graphs. - Gábor Bacsó (Discret. Math., 1997)

On minimal imperfect graphs with circular symmetry. - Gábor Bacsó; Endre Boros; Vladimir Gurvich; Frédéric Maffray; Myriam Preissmann (J. Graph Theory, 1998)

Structural domination of graphs. - Gábor Bacsó; Zsolt Tuza (Ars Comb., 2002)

Independence, irredundance, degrees and chromatic number in graphs. - Gábor Bacsó; Odile Favaron (Discret. Math., 2002)

Elementary Bipartite Graphs and Unique Colourability. - Gábor Bacsó (Eur. J. Comb., 2002)

Unique colorings of bi-hypergraphs. - Gábor Bacsó; Zsolt Tuza; Vitaly I. Voloshin (Australas. J Comb., 2003)

Graphs without induced P5 and C5. - Gábor Bacsó; Zsolt Tuza (Discuss. Math. Graph Theory, 2004)

Coloring the Maximal Cliques of Graphs. - Gábor Bacsó; Sylvain Gravier; András Gyárfás; Myriam Preissmann; András Sebö (SIAM J. Discret. Math., 2004)

Dominating Bipartite Subgraphs in Graphs. - Gábor Bacsó; Danuta Michalak; Zsolt Tuza (Discuss. Math. Graph Theory, 2005)

Graph Domination in Distance Two. - Gábor Bacsó; Attila Tálos; Zsolt Tuza (Discuss. Math. Graph Theory, 2005)

The cost chromatic number and hypergraph parameters. - Gábor Bacsó; Zsolt Tuza (Discuss. Math. Graph Theory, 2006)

Characterization of graphs dominated by induced paths. - Gábor Bacsó; Zsolt Tuza; Margit Voigt (Discret. Math., 2007)

Complete description of forbidden subgraphs in the structural domination problem. - Gábor Bacsó (Discret. Math., 2009)

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. - Gábor Bacsó; Zsolt Tuza (Discret. Math. Theor. Comput. Sci., 2009)

Infinite versus finite graph domination. - Gábor Bacsó; Heinz A. Jung; Zsolt Tuza (Discret. Math., 2010)

Optimal guard sets and the Helly property. - Gábor Bacsó; Zsolt Tuza (Eur. J. Comb., 2011)

Distance domination versus iterated domination. - Gábor Bacsó; Zsolt Tuza (Discret. Math., 2012)

Matching Matchings. - Gábor Bacsó; Anita Keszler; Zsolt Tuza (ECBS-EERC, 2013)

On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data. - Gábor Bacsó; Ádám Visegrádi; Attila Kertész; Zsolt Németh (J. Grid Comput., 2014)

Minimum order of graphs with given coloring parameters. - Gábor Bacsó; Piotr Borowiecki; Mihály Hujter; Zsolt Tuza (Discret. Math., 2015)

H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms. - Gábor Bacsó; Dániel Marx; Zsolt Tuza (IPEC, 2016)

A Set of Successive Job Allocation Models in Distributed Computing Infrastructures. - Gábor Bacsó; Tamás Kis; Ádám Visegrádi; Attila Kertész; Zsolt Németh (J. Grid Comput., 2016)

Coloring the cliques of line graphs. - Gábor Bacsó; Zdenek Ryjácek; Zsolt Tuza (Discret. Math., 2017)

Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. - Gábor Bacsó; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Zsolt Tuza; Erik Jan van Leeuwen (CoRR, 2018)

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. - Gábor Bacsó; Daniel Lokshtanov; Dániel Marx; Marcin Pilipczuk; Zsolt Tuza; Erik Jan van Leeuwen (Algorithmica, 2019)

Disjoint Paired-Dominating sets in Cubic Graphs. - Gábor Bacsó; Csilla Bujtás; Casey Tompkins; Zsolt Tuza (Graphs Comb., 2019)

Sanskruti Index of Some Important Bethe Trees. - Haneen Al-Janabi; Gábor Bacsó (ICoMS, 2021)

Chromatic uniqueness of zero-divisor graphs. - Haneen Al-Janabi; Gábor Bacsó (Art Discret. Appl. Math., 2022)

Graphs with equal Grundy domination and independence number. - Gábor Bacsó; Bostjan Bresar; Kirsti Kuenzel; Douglas F. Rall (Discret. Optim., 2023)

The Robust Chromatic Number of Graphs. - Gábor Bacsó; Balázs Patkós; Zsolt Tuza; Máté Vizer (Graphs Comb., 2024)