 | 2011 |
|---|
| 14 |       | Gábor Bacsó,
Zsolt Tuza:
Optimal guard sets and the Helly property.
Eur. J. Comb. 32(1): 28-32 (2011) |
| 2010 |
|---|
| 13 | | Gábor Bacsó,
Heinz A. Jung,
Zsolt Tuza:
Infinite versus finite graph domination.
Discrete Mathematics 310(9): 1495-1500 (2010) |
| 2009 |
|---|
| 12 | | Gábor Bacsó:
Complete description of forbidden subgraphs in the structural domination problem.
Discrete Mathematics 309(8): 2466-2472 (2009) |
| 11 | | Gábor Bacsó,
Zsolt Tuza:
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree.
Discrete Mathematics & Theoretical Computer Science 11(2): 15-24 (2009) |
| 2007 |
|---|
| 10 | | Gábor Bacsó,
Zsolt Tuza,
Margit Voigt:
Characterization of graphs dominated by induced paths.
Discrete Mathematics 307(7-8): 822-826 (2007) |
| 2006 |
|---|
| 9 | | Gábor Bacsó,
Zsolt Tuza:
The cost chromatic number and hypergraph parameters.
Discussiones Mathematicae Graph Theory 26(3): 369-376 (2006) |
| 2005 |
|---|
| 8 | | Gábor Bacsó,
Attila Tálos,
Zsolt Tuza:
Graph Domination in Distance Two.
Discussiones Mathematicae Graph Theory 25(1-2): 121-128 (2005) |
| 7 | | Gábor Bacsó,
Danuta Michalak,
Zsolt Tuza:
Dominating Bipartite Subgraphs in Graphs.
Discussiones Mathematicae Graph Theory 25(1-2): 85-94 (2005) |
| 2004 |
|---|
| 6 | | Gábor Bacsó,
Sylvain Gravier,
András Gyárfás,
Myriam Preissmann,
András Sebö:
Coloring the Maximal Cliques of Graphs.
SIAM J. Discrete Math. 17(3): 361-376 (2004) |
| 2002 |
|---|
| 5 |  | Gábor Bacsó,
Zsolt Tuza:
Structural domination of graphs.
Ars Comb. 63: (2002) |
| 4 | | Gábor Bacsó,
Odile Favaron:
Independence, irredundance, degrees and chromatic number in graphs.
Discrete Mathematics 259(1-3): 257-262 (2002) |
| 3 | | Gábor Bacsó:
Elementary Bipartite Graphs and Unique Colourability.
Eur. J. Comb. 23(3): 253-256 (2002) |
| 1997 |
|---|
| 2 | | Gábor Bacsó:
On a conjecture about uniquely colorable perfect graphs.
Discrete Mathematics 176(1-3): 1-19 (1997) |
| 1993 |
|---|
| 1 | | Gábor Bacsó,
Zsolt Tuza:
Domination properties and induced subgraphs.
Discrete Mathematics 111(1-3): 37-40 (1993) |
Data released under the ODC-BY 1.0 license — See also our legal information page