2008 |
9 | | János Barát,
P. P. Varju:
On square-free edge colorings of graphs.
Ars Comb. 87: (2008) |
2006 |
8 | EE | G. Ambrus,
János Barát:
A contribution to queens graphs: A substitution method.
Discrete Mathematics 306(12): 1105-1114 (2006) |
7 | EE | János Barát,
Jirí Matousek,
David R. Wood:
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness.
Electr. J. Comb. 13(1): (2006) |
6 | EE | János Barát:
Directed Path-width and Monotonicity in Digraph Searching.
Graphs and Combinatorics 22(2): 161-172 (2006) |
5 | EE | János Barát,
Carsten Thomassen:
Claw-decompositions and tutte-orientations.
Journal of Graph Theory 52(2): 135-146 (2006) |
2004 |
4 | EE | 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 | EE | 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 | EE | János Barát,
Péter Hajnal:
The Arc-Width of a Graph.
Electr. J. Comb. 8(1): (2001) |
1 | EE | János Barát:
2-star-coloring of graphs.
Electronic Notes in Discrete Mathematics 10: 17-19 (2001) |