Gábor Bacsó

34 papers B 1Journal 31Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
The robust chromatic number of certain graph classes.
Discuss. Math. Graph Theory
Gábor Bacsó, Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer
2024 J jnl
The Robust Chromatic Number of Graphs.
Graphs Comb.
Gábor Bacsó, Balázs Patkós, Zsolt Tuza, Máté Vizer
2023 J jnl
Graphs with equal Grundy domination and independence number.
Discret. Optim.
Gábor Bacsó, Bostjan Bresar, Kirsti Kuenzel, Douglas F. Rall
2022 J jnl
Chromatic uniqueness of zero-divisor graphs.
Art Discret. Appl. Math.
Haneen Al-Janabi, Gábor Bacsó
2021 — conf
Sanskruti Index of Some Important Bethe Trees.
ICoMS
Haneen Al-Janabi, Gábor Bacsó
2019 J jnl
Disjoint Paired-Dominating sets in Cubic Graphs.
Graphs Comb.
Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza
2019 J jnl
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs.
Algorithmica
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2018 J jnl
Subexponential-time Algorithms for Maximum Independent Set in P
CoRR
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
2017 J jnl
Coloring the cliques of line graphs.
Discret. Math.
Gábor Bacsó, Zdenek Ryjácek, Zsolt Tuza
2016 J jnl
A Set of Successive Job Allocation Models in Distributed Computing Infrastructures.
J. Grid Comput.
Gábor Bacsó, Tamás Kis, Ádám Visegrádi, Attila Kertész, Zsolt Németh
2016 B conf
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms.
IPEC
Gábor Bacsó, Dániel Marx, Zsolt Tuza
2015 J jnl
Minimum order of graphs with given coloring parameters.
Discret. Math.
Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza
2014 J jnl
On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data.
J. Grid Comput.
Gábor Bacsó, Ádám Visegrádi, Attila Kertész, Zsolt Németh
2013 — conf
Matching Matchings.
ECBS-EERC
Gábor Bacsó, Anita Keszler, Zsolt Tuza
2013 J jnl
Minimum order of graphs with given coloring parameters.
CoRR
Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza
2012 J jnl
Distance domination versus iterated domination.
Discret. Math.
Gábor Bacsó, Zsolt Tuza
2011 J jnl
Optimal guard sets and the Helly property.
Eur. J. Comb.
Gábor Bacsó, Zsolt Tuza
2010 J jnl
Infinite versus finite graph domination.
Discret. Math.
Gábor Bacsó, Heinz A. Jung, Zsolt Tuza
2009 J jnl
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree.
Discret. Math. Theor. Comput. Sci.
Gábor Bacsó, Zsolt Tuza
2009 J jnl
Complete description of forbidden subgraphs in the structural domination problem.
Discret. Math.
Gábor Bacsó
2007 J jnl
Characterization of graphs dominated by induced paths.
Discret. Math.
Gábor Bacsó, Zsolt Tuza, Margit Voigt
2006 J jnl
The cost chromatic number and hypergraph parameters.
Discuss. Math. Graph Theory
Gábor Bacsó, Zsolt Tuza
2005 J jnl
Dominating Bipartite Subgraphs in Graphs.
Discuss. Math. Graph Theory
Gábor Bacsó, Danuta Michalak, Zsolt Tuza
2005 J jnl
Graph Domination in Distance Two.
Discuss. Math. Graph Theory
Gábor Bacsó, Attila Tálos, Zsolt Tuza
2004 J jnl
Coloring the Maximal Cliques of Graphs.
SIAM J. Discret. Math.
Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
2004 J jnl
Graphs without induced
Discuss. Math. Graph Theory
Gábor Bacsó, Zsolt Tuza
2003 J jnl
Unique colorings of bi-hypergraphs.
Australas. J Comb.
Gábor Bacsó, Zsolt Tuza, Vitaly I. Voloshin
2002 J jnl
Elementary Bipartite Graphs and Unique Colourability.
Eur. J. Comb.
Gábor Bacsó
2002 J jnl
Independence, irredundance, degrees and chromatic number in graphs.
Discret. Math.
Gábor Bacsó, Odile Favaron
2002 J jnl
Structural domination of graphs.
Ars Comb.
Gábor Bacsó, Zsolt Tuza
1998 J jnl
On minimal imperfect graphs with circular symmetry.
J. Graph Theory
Gábor Bacsó, Endre Boros, Vladimir Gurvich, Frédéric Maffray, Myriam Preissmann
1997 J jnl
On a conjecture about uniquely colorable perfect graphs.
Discret. Math.
Gábor Bacsó
1993 J jnl
Domination properties and induced subgraphs.
Discret. Math.
Gábor Bacsó, Zsolt Tuza
1990 J jnl
A characterization of graphs without long induced paths.
J. Graph Theory
Gábor Bacsó, Zsolt Tuza