643 search results - page 94 / 129 » Supereulerian planar graphs |
COCOON
2003
Springer
14 years 26 days ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
SIAMDM
2010
13 years 2 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce the notion of Lombardi graph drawings, named after the abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line seg...
STOC
1990
ACM
13 years 11 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...