 | 2012 |
| 18 |  | János Barát,
Zoltán Füredi,
Ida Kantor,
Younjin Kim,
Balázs Patkós:
Large Bd-Free and Union-free Subfamilies.
SIAM J. Discrete Math. 26(1): 71-76 (2012) |
| 2011 |
| 17 |  | János Barát,
Gwenaël Joret,
David R. Wood:
Disproof of the List Hadwiger Conjecture
CoRR abs/1110.2272: (2011) |
| 16 |  | János Barát,
Gwenaël Joret,
David R. Wood:
Disproof of the List Hadwiger Conjecture.
Electr. J. Comb. 18(1): (2011) |
| 15 |  | János Barát,
Zoltán Füredi,
Ida Kantor,
Younjin Kim,
Balázs Patkós:
Large Bd-free and union-free subfamilies.
Electronic Notes in Discrete Mathematics 38: 101-104 (2011) |
| 14 |  | János Barát,
Péter Hajnal,
Eszter K. Horváth:
Elementary proof techniques for the maximum number of islands.
Eur. J. Comb. 32(2): 276-281 (2011) |
| 2010 |
| 13 |  | János Barát,
Matthias Kriesell:
What is on his mind?
Discrete Mathematics 310(20): 2573-2583 (2010) |
| 12 |  | János Barát,
Milos Stojakovic:
On Winning Fast in Avoider-Enforcer Games.
Electr. J. Comb. 17(1): (2010) |
| 11 |  | János Barát,
Géza Tóth:
Towards the Albertson Conjecture.
Electr. J. Comb. 17(1): (2010) |
| 2008 |
| 10 |  | János Barát,
P. P. Varju:
On square-free edge colorings of graphs.
Ars Comb. 87: (2008) |
| 9 |  | János Barát,
David R. Wood:
Notes on Nonrepetitive Graph Colouring.
Electr. J. Comb. 15(1): (2008) |
| 2006 |
| 8 |  | G. Ambrus,
János Barát:
A contribution to queens graphs: A substitution method.
Discrete Mathematics 306(12): 1105-1114 (2006) |
| 7 |  | János Barát,
Jirí Matousek,
David R. Wood:
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness.
Electr. J. Comb. 13(1): (2006) |
| 6 |  | János Barát:
Directed Path-width and Monotonicity in Digraph Searching.
Graphs and Combinatorics 22(2): 161-172 (2006) |
| 5 |  | János Barát,
Carsten Thomassen:
Claw-decompositions and tutte-orientations.
Journal of Graph Theory 52(2): 135-146 (2006) |
| 2004 |
| 4 |  | János Barát,
Alberto Del Fra,
Stefano Innamorati,
Leo Storme:
Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8).
Des. Codes Cryptography 31(1): 15-26 (2004) |
| 3 |  | János Barát,
Leo Storme:
Multiple Blocking Sets in PG(n, q), n>3.
Des. Codes Cryptography 33(1): 5-21 (2004) |
| 2001 |
| 2 |  | János Barát,
Péter Hajnal:
The Arc-Width of a Graph.
Electr. J. Comb. 8(1): (2001) |
| 1 |  | János Barát:
2-star-coloring of graphs.
Electronic Notes in Discrete Mathematics 10: 17-19 (2001) |