Results 1 to 10 of about 1,353,416 (150)
Counting Plane Graphs: Cross-Graph Charging Schemes [PDF]
Lecture Notes in Computer Science, 2013 We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs.
Micha Sharir, Adam Sheffer
exaly +2 more sources
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Lecture Notes in Computer Science, 2009 We describe a method for producing a greedy embedding of any n- vertex simple graph G in the hyperbolic plane, so that a message M between any pair of vertices may be routed by having each vertex that receives M pass it to a neighbor that is closer to M ’
Michael Goodrich, David Eppstein
exaly +2 more sources
Some of the next articles are maybe not open access.
The splitting number of the complete graph in the projective plane
Graphs and Combinatorics, 1987exaly
Recurrence and transience of the edge graph of a tiling of the euclidean plane
Mathematische Annalen, 1990exaly
Number of triangular packings of a marked graph on a projective plane
Journal of Soviet Mathematics, 1992exaly
The crossing number of the generalized Petersen graph P(3k,k) in the projective plane
AKCE International Journal of Graphs and Combinatoricsexaly
On the Upward Planarity of Mixed Plane Graphs [PDF]
Journal of Graph Algorithms and Applications, 2014 A mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and a set of undirected edges. An orientation of a mixed plane graph G is an assignment of directions to the undirected edges of G resulting in a directed ...
Fabrizio Frati +4 more
doaj +2 more sources
The nonsolvability by radicals of generic 3-connected planar Laman graphs. [PDF]
, 2007 We show that planar embeddable -connected Laman graphs are generically non-soluble. A Laman graph represents a configuration of points on the Euclidean plane with just enough distance specifications between them to ensure rigidity.
Power, Stephen C., Owen, J. C.
core +4 more sources