Gábor Bacsó

According to our database1, Gábor Bacsó authored at least 31 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Graphs with equal Grundy domination and independence number.
Discret. Optim., May, 2023

2022
Chromatic uniqueness of zero-divisor graphs.
Art Discret. Appl. Math., October, 2022

2021
Sanskruti Index of Some Important Bethe Trees.
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.
Graphs Comb., 2019

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs.
Algorithmica, 2019

2018
Subexponential-time Algorithms for Maximum Independent Set in P<sub>t</sub>-free and Broom-free Graphs.
CoRR, 2018

2017
Coloring the cliques of line graphs.
Discret. Math., 2017

2016
A Set of Successive Job Allocation Models in Distributed Computing Infrastructures.
J. Grid Comput., 2016

H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
Minimum order of graphs with given coloring parameters.
Discret. Math., 2015

2014
On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data.
J. Grid Comput., 2014

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

2012
Distance domination versus iterated domination.
Discret. Math., 2012

2011
Optimal guard sets and the Helly property.
Eur. J. Comb., 2011

2010
Infinite versus finite graph domination.
Discret. Math., 2010

2009
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree.
Discret. Math. Theor. Comput. Sci., 2009

Complete description of forbidden subgraphs in the structural domination problem.
Discret. Math., 2009

2007
Characterization of graphs dominated by induced paths.
Discret. Math., 2007

2006
The cost chromatic number and hypergraph parameters.
Discuss. Math. Graph Theory, 2006

2005
Graph Domination in Distance Two.
Discuss. Math. Graph Theory, 2005

Dominating Bipartite Subgraphs in Graphs.
Discuss. Math. Graph Theory, 2005

2004
Coloring the Maximal Cliques of Graphs.
SIAM J. Discret. Math., 2004

Graphs without induced <i>P<sub>5</sub></i> and <i> C<sub>5</sub></i>.
Discuss. Math. Graph Theory, 2004

2003
Unique colorings of bi-hypergraphs.
Australas. J Comb., 2003

2002
Elementary Bipartite Graphs and Unique Colourability.
Eur. J. Comb., 2002

Independence, irredundance, degrees and chromatic number in graphs.
Discret. Math., 2002

Structural domination of graphs.
Ars Comb., 2002

1998
On minimal imperfect graphs with circular symmetry.
J. Graph Theory, 1998

1997
On a conjecture about uniquely colorable perfect graphs.
Discret. Math., 1997

1993
Domination properties and induced subgraphs.
Discret. Math., 1993

1990
A characterization of graphs without long induced paths.
J. Graph Theory, 1990


  Loading...