default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJános Barát
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j43]János Barát, Zoltán L. Blázsik:
Quest for graphs of Frank number 3. Australas. J Comb. 88: 52-76 (2024)- [j42]János Barát
:
On the number of edges in a K5-minor-free graph of given girth. Discret. Math. 347(7): 114042 (2024) - [j41]János Barát, Andrzej Grzesik, Attila Jung, Zoltán Lóránt Nagy, Dömötör Pálvölgyi:
The double Hall property and cycle covers in bipartite graphs. Discret. Math. 347(9): 114079 (2024) - [j40]János Barát, Zoltán Blázsik:
General sharp upper bounds on the total coalition number. Discuss. Math. Graph Theory 44(4): 1567-1584 (2024) - [j39]János Barát, Zoltán L. Blázsik:
Improved upper bound on the Frank number of 3-edge-connected graphs. Eur. J. Comb. 118: 103913 (2024) - [j38]János Barát, András Gyárfás, Géza Tóth:
Monochromatic spanning trees and matchings in ordered complete graphs. J. Graph Theory 105(4): 523-541 (2024) - [j37]János Barát, Dániel Gerbner, Anastasia Halfpap:
On the number of A-transversals in hypergraphs. Period. Math. Hung. 89(1): 107-115 (2024) - 2023
- [j36]János Barát, Géza Tóth:
Saturated 2-plane drawings with few edges. Ars Math. Contemp. 24(1): 1 (2023) - [j35]János Barát, Zoltán L. Blázsik, Gábor Damásdi:
Crumby colorings - Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen. Discret. Math. 346(4): 113281 (2023) - [j34]János Barát:
Extremal K4-minor-free graphs without short cycles. Period. Math. Hung. 86(1): 108-114 (2023) - 2022
- [j33]János Barát, Géza Tóth:
Improvement on the Crossing Number of Crossing-Critical Graphs. Discret. Comput. Geom. 67(2): 595-604 (2022) - 2020
- [c1]János Barát, Géza Tóth:
Improvement on the Crossing Number of Crossing-Critical Graphs. GD 2020: 372-381
2010 – 2019
- 2019
- [j32]János Barát, Zoltán Lóránt Nagy:
Transversals in generalized Latin squares. Ars Math. Contemp. 16(1): 39-47 (2019) - [j31]János Barát:
Decomposition of cubic graphs related to Wegner's conjecture. Discret. Math. 342(5): 1520-1527 (2019) - [j30]A. Abu-Khazneh, János Barát, Alexey Pokrovskiy, Tibor Szabó:
A family of extremal hypergraphs for Ryser's conjecture. J. Comb. Theory A 161: 164-177 (2019) - 2018
- [j29]János Barát, Géza Tóth:
Improvements on the density of maximal 1-planar graphs. J. Graph Theory 88(1): 101-109 (2018) - 2017
- [j28]János Barát, András Gyárfás, Gábor N. Sárközy:
Rainbow matchings in bipartite multigraphs. Period. Math. Hung. 74(1): 108-111 (2017) - 2016
- [j27]János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy:
Ramsey number of paths and connected matchings in Ore-type host graphs. Discret. Math. 339(6): 1690-1698 (2016) - [j26]Ron Aharoni, János Barát, Ian M. Wanless:
Multipartite Hypergraphs Achieving Equality in Ryser's Conjecture. Graphs Comb. 32(1): 1-15 (2016) - [j25]János Barát, Gábor N. Sárközy:
Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles. J. Graph Theory 81(4): 317-328 (2016) - 2015
- [j24]János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood:
Empty Pentagons in Point Sets with Collinearities. SIAM J. Discret. Math. 29(1): 198-209 (2015) - 2014
- [j23]János Barát, Ian M. Wanless:
Rainbow matchings and transversals. Australas. J Comb. 59: 211-217 (2014) - [j22]József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy:
Partitioning 2-edge-colored graphs by monochromatic paths and cycles. Comb. 34(5): 507-526 (2014) - [j21]János Barát, Dániel Gerbner:
Edge-decomposition of Graphs into Copies of a Tree with Four Edges. Electron. J. Comb. 21(1): 1 (2014) - 2013
- [j20]János Barát, Július Czap:
Facial Nonrepetitive Vertex Coloring of Plane Graphs. J. Graph Theory 74(1): 115-121 (2013) - 2012
- [j19]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. Discret. Math. 26(1): 71-76 (2012) - [i2]János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood:
Empty pentagons in point sets with collinearities. CoRR abs/1207.3633 (2012) - 2011
- [j18]János Barát, Gwenaël Joret, David R. Wood:
Disproof of the List Hadwiger Conjecture. Electron. J. Comb. 18(1) (2011) - [j17]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) - [j16]János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós:
Large Bd-free and union-free subfamilies. Electron. Notes Discret. Math. 38: 101-104 (2011) - [i1]János Barát, Gwenaël Joret, David R. Wood:
Disproof of the List Hadwiger Conjecture. CoRR abs/1110.2272 (2011) - 2010
- [j15]János Barát, Milos Stojakovic:
On Winning Fast in Avoider-Enforcer Games. Electron. J. Comb. 17(1) (2010) - [j14]János Barát, Géza Tóth:
Towards the Albertson Conjecture. Electron. J. Comb. 17(1) (2010) - [j13]János Barát, Matthias Kriesell:
What is on his mind? Discret. Math. 310(20): 2573-2583 (2010)
2000 – 2009
- 2008
- [j12]János Barát, Peter P. Varju:
On square-free edge colorings of graphs. Ars Comb. 87 (2008) - [j11]János Barát, David R. Wood:
Notes on Nonrepetitive Graph Colouring. Electron. J. Comb. 15(1) (2008) - 2006
- [j10]János Barát, Jirí Matousek, David R. Wood:
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. Electron. J. Comb. 13(1) (2006) - [j9]Gergely Ambrus, János Barát:
A contribution to queens graphs: A substitution method. Discret. Math. 306(12): 1105-1114 (2006) - [j8]János Barát:
Directed Path-width and Monotonicity in Digraph Searching. Graphs Comb. 22(2): 161-172 (2006) - [j7]János Barát, Carsten Thomassen:
Claw-decompositions and tutte-orientations. J. Graph Theory 52(2): 135-146 (2006) - 2004
- [j6]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 Cryptogr. 31(1): 15-26 (2004) - [j5]János Barát, Leo Storme:
Multiple Blocking Sets in PG(n, q), n>3. Des. Codes Cryptogr. 33(1): 5-21 (2004) - 2001
- [j4]János Barát, Péter Hajnal:
The Arc-Width of a Graph. Electron. J. Comb. 8(1) (2001) - [j3]János Barát, Péter Hajnal:
Operations Which Preserve Path-Width at Most Two. Comb. Probab. Comput. 10(4): 277-291 (2001) - [j2]János Barát:
2-star-coloring of graphs. Electron. Notes Discret. Math. 10: 17-19 (2001)
1990 – 1999
- 1992
- [j1]János Barát:
Scenario playing for critical success factor analysis. J. Inf. Technol. 7(1): 12-19 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
