35 citations · 94 across the 13 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Improvements on the density of maximal 1-planar graphs
János Barát, Géza Tóth
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. sho…
math.CO2015★ 35 cited
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
Jozsef Balogh, Janos Barat, Daniel Gerbner +2
We present results on partitioning the vertices of -edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of Sárköz…
math.CO2015★ 4 cited
Rainbow matchings in bipartite multigraphs
János Barát, András Gyárfás, Gábor N. Sárközy
Suppose that is a non-negative integer and a bipartite multigraph is the union of matchings , each of…