13 citations · 18 across the 3 of their papers we have counts for
4 papers
On an extremal problem in the class of 1-planar graphs
Július Czap, Jakub Przybyło, Erika Škrabuľáková
A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite -planar graphs with presc…
Three classes of 1-planar graphs
Július Czap, Peter Šugerek
A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs…
Joins of 1-planar graphs
Július Czap, Dávid Hudák, Tomáš Madaras
A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the joi…
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…