Sciweavers

15 search results - page 2 / 3
» On the Connectivity of Graphs Embedded in Surfaces II
Sort
View
WG
2010
Springer
13 years 3 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
IPL
2010
111views more  IPL 2010»
13 years 3 months ago
Connecting face hitting sets in planar graphs
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
Pascal Schweitzer, Patrick Schweitzer
STACS
2009
Springer
13 years 11 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
JCT
2002
93views more  JCT 2002»
13 years 4 months ago
Coloring Locally Bipartite Graphs on Surfaces
It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...
Bojan Mohar, Paul D. Seymour
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 4 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl