Results 291 to 300 of about 568,500 (305)
Some of the next articles are maybe not open access.
Discrete & Computational Geometry, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ardal, Hayri +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ardal, Hayri +4 more
openaire +2 more sources
Nonconvex Representations of Plane Graphs
SIAM Journal on Discrete Mathematics, 2012We show that every plane graph admits a planar straight-line drawing in which all faces with more than three vertices are nonconvex polygons.
DI BATTISTA, Giuseppe +2 more
openaire +1 more source
Acta Informatica, 1985
This paper presents two efficient algorithms for drawing plane graphs nicely. Both draw all edges of a graph as straight line segments without crossing lines. The first draws a plane graph ''convex'' if possible, that is, in a way that every inner face and the complement of the outer face are convex polygons.
Chiba, Norishige +2 more
openaire +1 more source
This paper presents two efficient algorithms for drawing plane graphs nicely. Both draw all edges of a graph as straight line segments without crossing lines. The first draws a plane graph ''convex'' if possible, that is, in a way that every inner face and the complement of the outer face are convex polygons.
Chiba, Norishige +2 more
openaire +1 more source
Plane Graphs and Planar Graphs
2003As we have seen, a graph can be represented graphically, that is, a graph can be drawn in the plane, and it is this kind of graphical presentation that helps us intuitively understand many of structural properties of graphs. In many real-world problems, for example, layout of printed circuits, one wish to draw a graph in the plane such that its edges ...
openaire +1 more source
INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
International Journal of Computational Geometry & Applications, 2006A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. In this paper we show that a plane graph G has an inner rectangular drawing D if and only if a new bipartite graph constructed from G has a perfect matching.
Miura, Kazuyuki +2 more
openaire +2 more sources
2003
Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33].
openaire +1 more source
Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33].
openaire +1 more source
1998
Plane graphs and their colorings have been the subject of intensive research since the beginnings of graph theory because of their connection to the fourcolor problem. As stated originally the four-color problem asked whether it is always possible to color the regions of a plane map with four colors such that regions which share a common boundary (and ...
Martin Aigner, Günter M. Ziegler
openaire +1 more source
Plane graphs and their colorings have been the subject of intensive research since the beginnings of graph theory because of their connection to the fourcolor problem. As stated originally the four-color problem asked whether it is always possible to color the regions of a plane map with four colors such that regions which share a common boundary (and ...
Martin Aigner, Günter M. Ziegler
openaire +1 more source
Neighbor‐connected graphs and projective planes
Networks, 1987AbstractIn [G. Gunther, Neighbor‐connectivity in regular graphs. Discrete Appl. Math. 11 (1985) 233–243] Gunther introduced the concept of a k neighbor‐connected graph, which has the property that the removal of any k − 1 closed neighborhoods neither disconnects the graph, nor leaves only a complete graph.
Gunther, G. +2 more
openaire +2 more sources
SIAM Journal on Computing, 1999
Plane graphs \(G\) can be represented by floor plans. A floor plan is a rectangle, partitioned into a set of disjoint rectilinear polygonal regions, which are called the modules. Every module presents a vertex, and it is required that two modules share a piece of their borders if and only if the corresponding vertices are adjacent in \(G\). It has been
openaire +1 more source
Plane graphs \(G\) can be represented by floor plans. A floor plan is a rectangle, partitioned into a set of disjoint rectilinear polygonal regions, which are called the modules. Every module presents a vertex, and it is required that two modules share a piece of their borders if and only if the corresponding vertices are adjacent in \(G\). It has been
openaire +1 more source