AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph
AbstractFor every graph H, there exists a polynomial-time algorithm deciding if a planar input graph...
AbstractA drawing of a graph in the plane is even if nonadjacent edges have an even number of inters...
AbstractPartial cubes as well as planar graphs have been extensively investigated. In this note we i...
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...
AbstractIn this paper we give a new proof of the well-known theorem of Kuratowski-Pontrjagin on plan...
AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the pl...
summary:Let $(L,\wedge ,\vee )$ be a finite lattice with a least element 0. $\mathbb {A} G(L)$ is an...
summary:Let $(L,\wedge ,\vee )$ be a finite lattice with a least element 0. $\mathbb {A} G(L)$ is an...
summary:Let $(L,\wedge ,\vee )$ be a finite lattice with a least element 0. $\mathbb {A} G(L)$ is an...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\e and G/e is...
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar ...
AbstractDifferent areas of discrete mathematics lead to instrinsically different characterizations o...
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar ...
AbstractFor every graph H, there exists a polynomial-time algorithm deciding if a planar input graph...
AbstractA drawing of a graph in the plane is even if nonadjacent edges have an even number of inters...
AbstractPartial cubes as well as planar graphs have been extensively investigated. In this note we i...
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...
AbstractIn this paper we give a new proof of the well-known theorem of Kuratowski-Pontrjagin on plan...
AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the pl...
summary:Let $(L,\wedge ,\vee )$ be a finite lattice with a least element 0. $\mathbb {A} G(L)$ is an...
summary:Let $(L,\wedge ,\vee )$ be a finite lattice with a least element 0. $\mathbb {A} G(L)$ is an...
summary:Let $(L,\wedge ,\vee )$ be a finite lattice with a least element 0. $\mathbb {A} G(L)$ is an...
AbstractKuratowski's Theorem characterizes planar graphs in terms of two excluded subgraphs. In this...
A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\e and G/e is...
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar ...
AbstractDifferent areas of discrete mathematics lead to instrinsically different characterizations o...
Few theorems are known about planar graphs. For, example, Kuratowski proved that a graph is planar ...
AbstractFor every graph H, there exists a polynomial-time algorithm deciding if a planar input graph...
AbstractA drawing of a graph in the plane is even if nonadjacent edges have an even number of inters...
AbstractPartial cubes as well as planar graphs have been extensively investigated. In this note we i...
DOI
Add to ORKG