Results 231 to 240 of about 86,037 (264)
Some of the next articles are maybe not open access.
Discrete & Computational Geometry, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hayri Ardal +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hayri Ardal +4 more
openaire +2 more sources
On the Number of Plane Geometric Graphs
Graphs and Combinatorics, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oswin Aichholzer +5 more
openaire +1 more source
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.
Giuseppe Di Battista +2 more
openaire +1 more source
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
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.
Norishige Chiba +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.
Norishige Chiba +2 more
openaire +1 more source
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
Facial Colorings of Plane Graphs
Journal of Interconnection Networks, 2019This paper extends and updates the survey [J. Czap, S. Jendrol’, Facially-constrained colorings of plane graphs: A survey, Discrete Math. 340 (2017) 2691–2703] on facial colorings. Different types of colorings of plane graphs are discussed in their vertex, edge, total, and list versions.
Július Czap, Stanislav Jendrol'
openaire +1 more source
The entire choosability of plane graphs
Journal of Combinatorial Optimization, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei-Fan Wang 0001 +3 more
openaire +1 more source
Coupled choosability of plane graphs
Journal of Graph Theory, 2008AbstractA plane graph G is coupled k‐choosable if, for any list assignment L satisfying $|{{L}}({{x}})|= {{k}}$ for every ${{x}}\in {{V}}({{G}})\cup {{F}}({{G}})$, there is a coloring that assigns to each vertex and each face a color from its list such that any two adjacent or incident elements receive distinct colors.
Wei-Fan Wang 0001, Ko-Wei Lih
openaire +1 more source
On 3-colorings of Plane Graphs
Acta Mathematicae Applicatae Sinica, English Series, 2004The main result of the paper states that any \(3\)-colouring of the vertices of a face of degree at least \(11\) in a planar graph \(G\) without cycles of length \(4\), \(5\) and \(7\) and with no pair of intersecting triangles (i.e. every two 3-cycles of \(G\) are vertex-disjoint) can be extended to a \(3\)-colouring of the whole graph \(G\).
openaire +1 more source