
Search the dblp DataBase
János Barát:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 János Barát, Péter Hajnal
The ArcWidth of a Graph. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2001, v:8, n:1, pp: [Journal]
 János Barát, Leo Storme
Multiple Blocking Sets in PG(n, q), n>3. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2004, v:33, n:1, pp:521 [Journal]
 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). [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2004, v:31, n:1, pp:1526 [Journal]
 G. Ambrus, János Barát
A contribution to queens graphs: A substitution method. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:12, pp:11051114 [Journal]
 János Barát
Directed Pathwidth and Monotonicity in Digraph Searching. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2006, v:22, n:2, pp:161172 [Journal]
 János Barát, Carsten Thomassen
Clawdecompositions and tutteorientations. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:52, n:2, pp:135146 [Journal]
On squarefree edge colorings of graphs. [Citation Graph (, )][DBLP]
BoundedDegree Graphs have Arbitrarily Large Geometric Thickness. [Citation Graph (, )][DBLP]
What is on his mind? [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
