Results 291 to 300 of about 151,154 (334)
Some of the next articles are maybe not open access.
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong, Seok-Hee, Eades, Peter
openaire +2 more sources
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong, Seok-Hee, Eades, Peter
openaire +1 more source
1998
Abstract A graph G is planar if it can be drawn in the plane or on the surface of a sphere so that no two edges meet, except at a vertex at which both are incident. Such a drawing partitions the set of points of the plane or sphere not lying on G into faces; for example, the following drawing has 6 faces.
Ronald C Read, Robin J Wilson
openaire +1 more source
Abstract A graph G is planar if it can be drawn in the plane or on the surface of a sphere so that no two edges meet, except at a vertex at which both are incident. Such a drawing partitions the set of points of the plane or sphere not lying on G into faces; for example, the following drawing has 6 faces.
Ronald C Read, Robin J Wilson
openaire +1 more source
The germanium quantum information route
Nature Reviews Materials, 2020Giordano Scappucci +2 more
exaly

