Items where Author is "Bacsó, Gábor"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | No Grouping
Number of items: 35.
DateAuthor/TitleDocument Type
2019Bacsó, Gábor and Bujtás, Cs and Tompkins, C and Tuza, Zs
Disjoint Paired-Dominating sets in Cubic Graphs
Article
2019Bacsó, Gábor and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Tuza, Zsolt
Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs
Article
2017Bacsó, Gábor and Ryjáček, Z and Tuza, Zsolt
Coloring the cliques of line graphs
Article
2017Bacsó, Gábor and Marx, Dániel and Tuza, Zsolt
H-free graphs, Independent Sets, and subexponential-time algorithms
Book Section
2015Bacsó, Gábor and Borowiecki, Piotr and Hujter, Mihály and Tuza, Zsolt
Minimum order of graphs with given coloring parameters
Article
2015Bacsó, Gábor and Kis, Tamás and Visegrádi, Ádám and Kertész, Attila and Németh, Zsolt
A Set of Successive Job Allocation Models in Distributed Computing Infrastructures
Article
2014Bacsó, Gábor and Visegrádi, Ádám and Kertész, Attila and Németh, Zsolt
On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data
ISI Article
2013-12Bacsó, Gábor and Héger, Tamás and Szőnyi, Tamás
The 2-Blocking Number and the Upper Chromatic Number ofPG(2,q)
ISI Article
2013Bacsó, Gábor and Héger, Tamás and Szőnyi, Tamás
The 2-Blocking Number and the Upper Chromatic Number of PG(2,q)
Article
2013Bacsó, Gábor and Keszler, Anita and Tuza, Zsolt
Matching matchings
Conference or Workshop Item
2012Bacsó, Gábor and Tuza, Zsolt
Distance domination versus iterated domination
ISI Article
2011Bacsó, Gábor and Tuza, Zsolt
Optimal guard sets and the Helly property
ISI Article
2010Bacsó, Gábor and Jung, H. A. and Tuza, Zsolt
Infinite versus finite graph domination
ISI Article
2010Bacsó, Gábor and Bujtás, Cs. and Tuza, Zsolt and Voloshin, V.
New challenges in the theory of hypergraph coloring
Conference or Workshop Item
2009Bacsó, Gábor and Tuza, Zsolt
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
ISI Article
2009Bacsó, Gábor
Complete description of forbidden subgraphs in the structural domination problem
ISI Article
2008Bacsó, Gábor and Bujtás, Csilla and Tuza, Zsolt and Voloshin, Vitaly
New challenges in the theory of hypergraph coloring
Conference or Workshop Item
2008Bacsó, Gábor and Héthelyi, László and Sziklai, Péter
New near-factorizations of finite groups
ISI Article
2008Bacsó, Gábor and Tuza, Zsolt
Upper chromatic number of finite projective planes
ISI Article
2007Bacsó, Gábor and Tuza, Zsolt and Voigt, M.
Characterization of graphs dominated by induced paths
ISI Article
2007Bacsó, Gábor
Perfectly orderable graphs and unique colorability
Article
2006Bacsó, Gábor and Tuza, Zsolt
The cost chromatic number and hypergraph parameters
Article
2005Bacsó, Gábor and Michalak, D. and Tuza, Zsolt
Dominating bipartite subgraphs in graphs
Article
2005Bacsó, Gábor and Tálos, A. and Tuza, Zsolt
Graph domination in distance two
Article
2004Bacsó, Gábor and Gravier, S. and Gyárfás, András and Preissmann, M. and Sebő, A.
Coloring the maximal cliques of graphs
Article
2004Bacsó, Gábor and Tuza, Zsolt
Graphs without induced P5 and C5
Article
2003Bacsó, Gábor and Tuza, Zsolt and Voroshin, V.
Unique colorings of bi-hypergraphs
Article
2002Bacsó, Gábor
Elementary bipartite graphs and unique colorability
Article
2002Bacsó, Gábor and Favron, O.
Independence, irredundance, degrees and chromatic number in graphs
Article
2002Bacsó, Gábor and Tuza, Zsolt
Structural domination of graphs
Article
1999Bacsó, Gábor and Tuza, Zsolt
Dominating subgraphs of small diameter
Article
1998Bacsó, Gábor and Boros, E. and Gurvich, F. and Maffray, F. and Preissmann, M.
On minimal imperfect graphs with circular symmetry
Article
1997Bacsó, Gábor
On a conjecture about uniquely colorable perfect graphs
Article
1996Bacsó, Gábor
Perfekt gráfok és domináns halmazok
Thesis
1993Bacsó, Gábor and Tuza, Zsolt
Domination properties and induced subgraphs
Article
This list was generated on Sun Nov 24 03:13:33 2024 CET.