23 citations · 25 across the 5 of their papers we have counts for
6 papers
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
Thomassen formulated the following conjecture: Every -connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree at most (that is, i…
Intersecting and -intersecting hypergraphs with maximal covering number: the Erdős-Lovász theme revisited
János Barát
Erdős and Lovász noticed that an -uniform intersecting hypergraph with maximal covering number, that is , must have at least edges. There has been n…
Improvement on the crossing number of crossing-critical graphs
János Barát, Géza Tóth
The crossing number of a graph is the minimum number of edge crossings over all drawings of in the plane. A graph is -crossing-critical if its crossing number is at…
Vertex coloring of plane graphs with nonrepetitive boundary paths
János Barát, Július Czap
A sequence is a repetition. A sequence is nonrepetitive, if no subsequence of consecutive terms of form a repetition. Let be a vertex…
On the structure of graphs with path-width at most two
János Barát, Péter Hajnal, Yixun Lin +1
Nancy G. Kinnersley and Michael A. Langston has determined the excluded minors for the class of graphs with path-width at most two by computer. Their list consisted of 110 graphs.…
Towards The Albertson Conjecture
János Barát, Géza Tóth
Albertson conjectured that if a graph has chromatic number then its crossing number is at least as much as the crossing number of . Albertson, Cranston, and Fox verifi…