Add to ORKGA graph G is ξ-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most ξ times. The family of ξ-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative parameterized graph family extending the notion of planarity, the λ-flat graphs, this time defined as powers of plane graphs in regard to a novel notion of distance, the wall-by-wall distance. We show that the two parameterized graph classes are parametrically equivalent
This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published arti...
We introduce a topological graph parameter s(G), defined for any graph G. This parameter characteriz...
We introduce a topological graph parameter s(G), defined for any graph G. This parameter characteriz...
A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is cr...
Planar graphs have a rich history that dates back to the 18th Century. They form one of the core con...
Planar graphs have a rich history that dates back to the 18th Century. They form one of the core con...
AbstractLet a be any vertex of a graph G. By deletion of a and of all those edges of G which are inc...
Planar graphs have been fertile grounds for algorithms research for decades, both because they model...
A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It i...
AbstractGiven a set S of points in the plane, the complete graph on S (the graph with an edge connec...
Given a set S of points in the plane, there is a triangulation of S such that a path found within th...
Given a set S of points in the plane, there is a triangulation of S such that a path found within th...
Given a set S of points in the plane, there is a triangulation of S such that a path found within th...
AbstractThe spherical genus sph(G) of a connected graph G is defined as the minimum number n such th...
AbstractA graph G=(V,E) is called a unit-distance graph in the plane if there is an embedding of V i...
This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published arti...
We introduce a topological graph parameter s(G), defined for any graph G. This parameter characteriz...
We introduce a topological graph parameter s(G), defined for any graph G. This parameter characteriz...
A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is cr...
Planar graphs have a rich history that dates back to the 18th Century. They form one of the core con...
Planar graphs have a rich history that dates back to the 18th Century. They form one of the core con...
AbstractLet a be any vertex of a graph G. By deletion of a and of all those edges of G which are inc...
Planar graphs have been fertile grounds for algorithms research for decades, both because they model...
A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It i...
AbstractGiven a set S of points in the plane, the complete graph on S (the graph with an edge connec...
Given a set S of points in the plane, there is a triangulation of S such that a path found within th...
Given a set S of points in the plane, there is a triangulation of S such that a path found within th...
Given a set S of points in the plane, there is a triangulation of S such that a path found within th...
AbstractThe spherical genus sph(G) of a connected graph G is defined as the minimum number n such th...
AbstractA graph G=(V,E) is called a unit-distance graph in the plane if there is an embedding of V i...
This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published arti...
We introduce a topological graph parameter s(G), defined for any graph G. This parameter characteriz...
We introduce a topological graph parameter s(G), defined for any graph G. This parameter characteriz...