AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the plane F × F, with non-crossing line segments as edges. It is shown that the graph G is F-planar for some F if and only if every finite subgraph of G is planar
AbstractA drawing of a graph in the plane is even if nonadjacent edges have an even number of inters...
AbstractA graph is a segment graph if its vertices can be mapped to line segments in the plane such ...
A graph G is a non-separating planar graph if there is a drawing D of G on the plane such that (1) n...
AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the pl...
AbstractA finite ordered set is planar when it can be represented in the plane with the point a lowe...
AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained f...
Abstract: A graph is called planar if it can be represented on the plane without points of intersect...
AbstractA finite ordered set is planar when it can be represented in the plane with the point a lowe...
AbstractLet a be any vertex of a graph G. By deletion of a and of all those edges of G which are inc...
AbstractIn this paper we give a new proof of the well-known theorem of Kuratowski-Pontrjagin on plan...
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar ...
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar ...
The following problem was raised by S. M. Ulam: Does there exist a countable planar graph Go such th...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
AbstractLet G be a graph Sedláček [2] has shown that the line graph of G is planar if and only if G ...
AbstractA drawing of a graph in the plane is even if nonadjacent edges have an even number of inters...
AbstractA graph is a segment graph if its vertices can be mapped to line segments in the plane such ...
A graph G is a non-separating planar graph if there is a drawing D of G on the plane such that (1) n...
AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the pl...
AbstractA finite ordered set is planar when it can be represented in the plane with the point a lowe...
AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained f...
Abstract: A graph is called planar if it can be represented on the plane without points of intersect...
AbstractA finite ordered set is planar when it can be represented in the plane with the point a lowe...
AbstractLet a be any vertex of a graph G. By deletion of a and of all those edges of G which are inc...
AbstractIn this paper we give a new proof of the well-known theorem of Kuratowski-Pontrjagin on plan...
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar ...
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar ...
The following problem was raised by S. M. Ulam: Does there exist a countable planar graph Go such th...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
AbstractLet G be a graph Sedláček [2] has shown that the line graph of G is planar if and only if G ...
AbstractA drawing of a graph in the plane is even if nonadjacent edges have an even number of inters...
AbstractA graph is a segment graph if its vertices can be mapped to line segments in the plane such ...
A graph G is a non-separating planar graph if there is a drawing D of G on the plane such that (1) n...
DOI
Add to ORKG