Add to ORKGA planar graph is said to be trivializable if every regular projection produces a trivial embedding for some over/under informations. Every minor of a trivializable graph is also trivializable, thus the set of forbidden graphs is finite. Seven forbidden graphs for the trivializability were previously known. In this paper, we exhibit nine more forbidden graphs
For every graph H, there exists a polynomial-time algorithm deciding if a planar input graph G can b...
For a finite collection of graphs F, the F-TM-Deletion problem has as input an n-vertex graph G and ...
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed v...
A planar graph is said to be trivializable if every regular projection produces a trivial embedding ...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
Abstract: A graph is called planar if it can be represented on the plane without points of intersect...
AbstractThis note is part of the implementation of a programme in foundations of mathematics to find...
AbstractLet G be a graph Sedláček [2] has shown that the line graph of G is planar if and only if G ...
The realizability of a graph is the smallest dimension, d, in which for any realization (placement o...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
We present the set of planar graphs that always have a simultaneous geometric embedding with a stric...
Abstract. We present the set of planar graphs that always have a simultaneous geometric embedding wi...
Let G be a finite graph. We give a label to each of vertices and edges of G. An embedding of G into ...
We consider the problem of coloring a planar graph with the minimum number of colors such that each ...
AbstractPointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with p...
For every graph H, there exists a polynomial-time algorithm deciding if a planar input graph G can b...
For a finite collection of graphs F, the F-TM-Deletion problem has as input an n-vertex graph G and ...
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed v...
A planar graph is said to be trivializable if every regular projection produces a trivial embedding ...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
Abstract: A graph is called planar if it can be represented on the plane without points of intersect...
AbstractThis note is part of the implementation of a programme in foundations of mathematics to find...
AbstractLet G be a graph Sedláček [2] has shown that the line graph of G is planar if and only if G ...
The realizability of a graph is the smallest dimension, d, in which for any realization (placement o...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
We present the set of planar graphs that always have a simultaneous geometric embedding with a stric...
Abstract. We present the set of planar graphs that always have a simultaneous geometric embedding wi...
Let G be a finite graph. We give a label to each of vertices and edges of G. An embedding of G into ...
We consider the problem of coloring a planar graph with the minimum number of colors such that each ...
AbstractPointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with p...
For every graph H, there exists a polynomial-time algorithm deciding if a planar input graph G can b...
For a finite collection of graphs F, the F-TM-Deletion problem has as input an n-vertex graph G and ...
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed v...