Scenario playing for critical success factor analysis. - János Barát (J. Inf. Technol., 1992)

The Arc-Width of a Graph. - János Barát; Péter Hajnal (Electron. J. Comb., 2001)

Operations Which Preserve Path-Width at Most Two. - János Barát; Péter Hajnal (Comb. Probab. Comput., 2001)

2-star-coloring of graphs. - János Barát (Electron. Notes Discret. Math., 2001)

Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8). - János Barát; Alberto Del Fra; Stefano Innamorati; Leo Storme (Des. Codes Cryptogr., 2004)

Multiple Blocking Sets in PG(n, q), n>3. - János Barát; Leo Storme (Des. Codes Cryptogr., 2004)

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. - János Barát; Jirí Matousek 001; David R. Wood (Electron. J. Comb., 2006)

A contribution to queens graphs: A substitution method. - Gergely Ambrus; János Barát (Discret. Math., 2006)

Directed Path-width and Monotonicity in Digraph Searching. - János Barát (Graphs Comb., 2006)

Claw-decompositions and tutte-orientations. - János Barát; Carsten Thomassen (J. Graph Theory, 2006)

On square-free edge colorings of graphs. - János Barát; Peter P. Varju (Ars Comb., 2008)

Notes on Nonrepetitive Graph Colouring. - János Barát; David R. Wood (Electron. J. Comb., 2008)

On Winning Fast in Avoider-Enforcer Games. - János Barát; Milos Stojakovic (Electron. J. Comb., 2010)

Towards the Albertson Conjecture. - János Barát; Géza Tóth 001 (Electron. J. Comb., 2010)

What is on his mind? - János Barát; Matthias Kriesell (Discret. Math., 2010)

Disproof of the List Hadwiger Conjecture. - János Barát; Gwenaël Joret; David R. Wood (Electron. J. Comb., 2011)

Elementary proof techniques for the maximum number of islands. - János Barát; Péter Hajnal; Eszter K. Horváth (Eur. J. Comb., 2011)

Large Bd-free and union-free subfamilies. - János Barát; Zoltán Füredi; Ida Kantor; Younjin Kim; Balázs Patkós (Electron. Notes Discret. Math., 2011)

Large Bd-Free and Union-free Subfamilies. - János Barát; Zoltán Füredi; Ida Kantor; Younjin Kim; Balázs Patkós (SIAM J. Discret. Math., 2012)

Facial Nonrepetitive Vertex Coloring of Plane Graphs. - János Barát; Július Czap (J. Graph Theory, 2013)

Rainbow matchings and transversals. - János Barát; Ian M. Wanless (Australas. J Comb., 2014)

Partitioning 2-edge-colored graphs by monochromatic paths and cycles. - József Balogh; János Barát; Dániel Gerbner; András Gyárfás; Gábor N. Sárközy (Comb., 2014)

Edge-decomposition of Graphs into Copies of a Tree with Four Edges. - János Barát; Dániel Gerbner (Electron. J. Comb., 2014)

Empty Pentagons in Point Sets with Collinearities. - János Barát; Vida Dujmovic; Gwenaël Joret; Michael S. Payne; Ludmila Scharf; Daria Schymura; Pavel Valtr 001; David R. Wood (SIAM J. Discret. Math., 2015)

Ramsey number of paths and connected matchings in Ore-type host graphs. - János Barát; András Gyárfás; Jeno Lehel; Gábor N. Sárközy (Discret. Math., 2016)

Multipartite Hypergraphs Achieving Equality in Ryser's Conjecture. - Ron Aharoni; János Barát; Ian M. Wanless (Graphs Comb., 2016)

Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles. - János Barát; Gábor N. Sárközy (J. Graph Theory, 2016)

Rainbow matchings in bipartite multigraphs. - János Barát; András Gyárfás; Gábor N. Sárközy (Period. Math. Hung., 2017)

Improvements on the density of maximal 1-planar graphs. - János Barát; Géza Tóth 001 (J. Graph Theory, 2018)

Transversals in generalized Latin squares. - János Barát; Zoltán Lóránt Nagy (Ars Math. Contemp., 2019)

Decomposition of cubic graphs related to Wegner's conjecture. - János Barát (Discret. Math., 2019)

A family of extremal hypergraphs for Ryser's conjecture. - A. Abu-Khazneh; János Barát; Alexey Pokrovskiy; Tibor Szabó (J. Comb. Theory A, 2019)

Improvement on the Crossing Number of Crossing-Critical Graphs. - János Barát; Géza Tóth 001 (GD, 2020)

Saturated 2-plane drawings with few edges. - János Barát; Géza Tóth 001 (Ars Math. Contemp., 2023)

Extremal K4-minor-free graphs without short cycles. - János Barát (Period. Math. Hung., 2023)

Crumby colorings - Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen. - János Barát; Zoltán L. Blázsik; Gábor Damásdi (Discret. Math., 2023)

On the number of edges in a K5-minor-free graph of given girth. - János Barát (Discret. Math., 2024)

The double Hall property and cycle covers in bipartite graphs. - János Barát; Andrzej Grzesik; Attila Jung; Zoltán Lóránt Nagy; Dömötör Pálvölgyi (Discret. Math., 2024)

General sharp upper bounds on the total coalition number. - János Barát; Zoltán Blázsik (Discuss. Math. Graph Theory, 2024)

Improved upper bound on the Frank number of 3-edge-connected graphs. - János Barát; Zoltán L. Blázsik (Eur. J. Comb., 2024)

Quest for graphs of Frank number 3. - János Barát; Zoltán L. Blázsik (Australas. J Comb., 2024)

Monochromatic spanning trees and matchings in ordered complete graphs. - János Barát; András Gyárfás; Géza Tóth 001 (J. Graph Theory, 2024)

On the number of A-transversals in hypergraphs. - János Barát; Dániel Gerbner; Anastasia Halfpap (Period. Math. Hung., 2024)

Clique Covers of Complete Graphs and Piercing Multitrack Intervals. - János Barát; András Gyárfás; Gábor N. Sárközy (Electron. J. Comb., 2025)