Gábor Bacsó

According to our database, Gábor Bacsó authored at least 32 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

The Robust Chromatic Number of Graphs.

Gábor Bacsó, Balázs Patkós, Zsolt Tuza, Máté Vizer

Graphs Comb., August, 2024

2023

Graphs with equal Grundy domination and independence number.

Gábor Bacsó, Bostjan Bresar, Kirsti Kuenzel, Douglas F. Rall

Discret. Optim., May, 2023

2022

Chromatic uniqueness of zero-divisor graphs.

Haneen Al-Janabi, Gábor Bacsó

Art Discret. Appl. Math., October, 2022

2021

Sanskruti Index of Some Important Bethe Trees.

Haneen Al-Janabi, Gábor Bacsó

Proceedings of the ICoMS 2021: 4th International Conference on Mathematics and Statistics, Paris, France, June 24, 2021

2019

Disjoint Paired-Dominating sets in Cubic Graphs.

Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza

Graphs Comb., 2019

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

2018

Subexponential-time Algorithms for Maximum Independent Set in P_t-free and Broom-free Graphs.

Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen

CoRR, 2018

2017

Coloring the cliques of line graphs.

Gábor Bacsó, Zdenek Ryjácek, Zsolt Tuza

Discret. Math., 2017

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

H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms.

Gábor Bacsó, Dániel Marx, Zsolt Tuza

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

Minimum order of graphs with given coloring parameters.

Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza

Discret. Math., 2015

2014

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

2013

Matching Matchings.

Gábor Bacsó, Anita Keszler, Zsolt Tuza

Proceedings of the 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, 2013

2012

Distance domination versus iterated domination.

Gábor Bacsó, Zsolt Tuza

Discret. Math., 2012

2011

Optimal guard sets and the Helly property.

Gábor Bacsó, Zsolt Tuza

Eur. J. Comb., 2011

2010

Infinite versus finite graph domination.

Gábor Bacsó, Heinz A. Jung, Zsolt Tuza

Discret. Math., 2010

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

Complete description of forbidden subgraphs in the structural domination problem.

Gábor Bacsó

Discret. Math., 2009

2007

Characterization of graphs dominated by induced paths.

Gábor Bacsó, Zsolt Tuza, Margit Voigt

Discret. Math., 2007

2006

The cost chromatic number and hypergraph parameters.

Gábor Bacsó, Zsolt Tuza

Discuss. Math. Graph Theory, 2006

2005

Graph Domination in Distance Two.

Gábor Bacsó, Attila Tálos, Zsolt Tuza

Discuss. Math. Graph Theory, 2005

Dominating Bipartite Subgraphs in Graphs.

Gábor Bacsó, Danuta Michalak, Zsolt Tuza

Discuss. Math. Graph Theory, 2005

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

Graphs without induced <i>P₅</i> and <i> C₅</i>.

Gábor Bacsó, Zsolt Tuza

Discuss. Math. Graph Theory, 2004

2003

Unique colorings of bi-hypergraphs.

Gábor Bacsó, Zsolt Tuza, Vitaly I. Voloshin

Australas. J Comb., 2003

2002

Elementary Bipartite Graphs and Unique Colourability.

Gábor Bacsó

Eur. J. Comb., 2002

Independence, irredundance, degrees and chromatic number in graphs.

Gábor Bacsó, Odile Favaron

Discret. Math., 2002

Structural domination of graphs.

Gábor Bacsó, Zsolt Tuza

Ars Comb., 2002

1998

On minimal imperfect graphs with circular symmetry.

Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann

J. Graph Theory, 1998

1997

On a conjecture about uniquely colorable perfect graphs.

Gábor Bacsó

Discret. Math., 1997

1993

Domination properties and induced subgraphs.

Gábor Bacsó, Zsolt Tuza

Discret. Math., 1993

1990

A characterization of graphs without long induced paths.

Gábor Bacsó, Zsolt Tuza

J. Graph Theory, 1990