DOIAbstract
AbstractA graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. We present the full characterization of 1-planar complete k-partite graphs
AbstractA graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. We present the full characterization of 1-planar complete k-partite graphs
Abstract. A visibility representation is a classical drawing style of pla-nar graphs. It displays th...
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In ...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
AbstractA graph is called 1-planar if there exists its drawing in the plane such that each edge is c...
A graph is called 1-planar if there exists a drawing in the plane so that each edge contains at most...
A graph is called 1-planar if there exists a drawing in the plane so that each edge contains at most...
A graph is 1-planar if it can be drawn in the plane such that each of its edges is crossed at most o...
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is cro...
AbstractA graph is called 1-planar if it can be drawn in the plane so that each its edge is crossed ...
AbstractA graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more ...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one...
A graph is 1-planar if it has a drawing in the plane such that each edge is crossed at most once by ...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
A 1-planar graph is a graph that can be embedded in the plane with at most one crossing per edge. It...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
Abstract. A visibility representation is a classical drawing style of pla-nar graphs. It displays th...
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In ...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
AbstractA graph is called 1-planar if there exists its drawing in the plane such that each edge is c...
A graph is called 1-planar if there exists a drawing in the plane so that each edge contains at most...
A graph is called 1-planar if there exists a drawing in the plane so that each edge contains at most...
A graph is 1-planar if it can be drawn in the plane such that each of its edges is crossed at most o...
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is cro...
AbstractA graph is called 1-planar if it can be drawn in the plane so that each its edge is crossed ...
AbstractA graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more ...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one...
A graph is 1-planar if it has a drawing in the plane such that each edge is crossed at most once by ...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
A 1-planar graph is a graph that can be embedded in the plane with at most one crossing per edge. It...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
Abstract. A visibility representation is a classical drawing style of pla-nar graphs. It displays th...
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In ...
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one othe...
Add to ORKG