János Barát

47 papers A 1Journal 46
YearRankTypeTitle / Venue / Authors
2025 J jnl
Clique Covers of Complete Graphs and Piercing Multitrack Intervals.
Electron. J. Comb.
János Barát, András Gyárfás, Gábor N. Sárközy
2024 J jnl
General sharp upper bounds on the total coalition number.
Discuss. Math. Graph Theory
János Barát, Zoltán Blázsik
2024 J jnl
Improved upper bound on the Frank number of 3-edge-connected graphs.
Eur. J. Comb.
János Barát, Zoltán L. Blázsik
2024 J jnl
Monochromatic spanning trees and matchings in ordered complete graphs.
J. Graph Theory
János Barát, András Gyárfás, Géza Tóth
2024 J jnl
On the number of A-transversals in hypergraphs.
Period. Math. Hung.
János Barát, Dániel Gerbner, Anastasia Halfpap
2024 J jnl
On the number of edges in a K5-minor-free graph of given girth.
Discret. Math.
János Barát
2024 J jnl
Quest for graphs of Frank number 3.
Australas. J Comb.
János Barát, Zoltán L. Blázsik
2024 J jnl
The double Hall property and cycle covers in bipartite graphs.
Discret. Math.
János Barát, Andrzej Grzesik, Attila Jung, Zoltán Lóránt Nagy, Dömötör Pálvölgyi
2023 J jnl
Crumby colorings - Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen.
Discret. Math.
János Barát, Zoltán L. Blázsik, Gábor Damásdi
2023 J jnl
Extremal K
Period. Math. Hung.
János Barát
2023 J jnl
Saturated 2-plane drawings with few edges.
Ars Math. Contemp.
János Barát, Géza Tóth
2022 J jnl
Improvement on the Crossing Number of Crossing-Critical Graphs.
Discret. Comput. Geom.
János Barát, Géza Tóth
2020 A conf
Improvement on the Crossing Number of Crossing-Critical Graphs.
GD
János Barát, Géza Tóth
2019 J jnl
A family of extremal hypergraphs for Ryser's conjecture.
J. Comb. Theory A
A. Abu-Khazneh, János Barát, Alexey Pokrovskiy, Tibor Szabó
2019 J jnl
Decomposition of cubic graphs related to Wegner's conjecture.
Discret. Math.
János Barát
2019 J jnl
Transversals in generalized Latin squares.
Ars Math. Contemp.
János Barát, Zoltán Lóránt Nagy
2018 J jnl
Improvements on the density of maximal 1-planar graphs.
J. Graph Theory
János Barát, Géza Tóth
2017 J jnl
Rainbow matchings in bipartite multigraphs.
Period. Math. Hung.
János Barát, András Gyárfás, Gábor N. Sárközy
2016 J jnl
Multipartite Hypergraphs Achieving Equality in Ryser's Conjecture.
Graphs Comb.
Ron Aharoni, János Barát, Ian M. Wanless
2016 J jnl
Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles.
J. Graph Theory
János Barát, Gábor N. Sárközy
2016 J jnl
Ramsey number of paths and connected matchings in Ore-type host graphs.
Discret. Math.
János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy
2015 J jnl
Empty Pentagons in Point Sets with Collinearities.
SIAM J. Discret. Math.
János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
2014 J jnl
Edge-decomposition of Graphs into Copies of a Tree with Four Edges.
Electron. J. Comb.
János Barát, Dániel Gerbner
2014 J jnl
Partitioning 2-edge-colored graphs by monochromatic paths and cycles.
Comb.
József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy
2014 J jnl
Rainbow matchings and transversals.
Australas. J Comb.
János Barát, Ian M. Wanless
2013 J jnl
Facial Nonrepetitive Vertex Coloring of Plane Graphs.
J. Graph Theory
János Barát, Július Czap
2012 J jnl
Empty pentagons in point sets with collinearities
CoRR
János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
2012 J jnl
Large B
SIAM J. Discret. Math.
János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós
2011 J jnl
Disproof of the List Hadwiger Conjecture
CoRR
János Barát, Gwenaël Joret, David R. Wood
2011 J jnl
Disproof of the List Hadwiger Conjecture.
Electron. J. Comb.
János Barát, Gwenaël Joret, David R. Wood
2011 J jnl
Elementary proof techniques for the maximum number of islands.
Eur. J. Comb.
János Barát, Péter Hajnal, Eszter K. Horváth
2011 J jnl
Large Bd-free and union-free subfamilies.
Electron. Notes Discret. Math.
János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós
2010 J jnl
On Winning Fast in Avoider-Enforcer Games.
Electron. J. Comb.
János Barát, Milos Stojakovic
2010 J jnl
Towards the Albertson Conjecture.
Electron. J. Comb.
János Barát, Géza Tóth
2010 J jnl
What is on his mind?
Discret. Math.
János Barát, Matthias Kriesell
2008 J jnl
Notes on Nonrepetitive Graph Colouring.
Electron. J. Comb.
János Barát, David R. Wood
2008 J jnl
On square-free edge colorings of graphs.
Ars Comb.
János Barát, Peter P. Varju
2006 J jnl
A contribution to queens graphs: A substitution method.
Discret. Math.
Gergely Ambrus, János Barát
2006 J jnl
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness.
Electron. J. Comb.
János Barát, Jirí Matousek, David R. Wood
2006 J jnl
Claw-decompositions and tutte-orientations.
J. Graph Theory
János Barát, Carsten Thomassen
2006 J jnl
Directed Path-width and Monotonicity in Digraph Searching.
Graphs Comb.
János Barát
2004 J jnl
Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8).
Des. Codes Cryptogr.
János Barát, Alberto Del Fra, Stefano Innamorati, Leo Storme
2004 J jnl
Multiple Blocking Sets in PG(
Des. Codes Cryptogr.
János Barát, Leo Storme
2001 J jnl
2-star-coloring of graphs.
Electron. Notes Discret. Math.
János Barát
2001 J jnl
Operations Which Preserve Path-Width at Most Two.
Comb. Probab. Comput.
János Barát, Péter Hajnal
2001 J jnl
The Arc-Width of a Graph.
Electron. J. Comb.
János Barát, Péter Hajnal
1992 J jnl
Scenario playing for critical success factor analysis.
J. Inf. Technol.
János Barát