Add to ORKGIn this paper we show the connection to Polyhedral Combinatorics of Graham and Winkler's powerful 'Metric Decomposition Theorem' (we also provide a new proof of it via polyhedral combinatorics), we sharpen it in the bipartite special case, and exhibit the connection of the results to multiflow theorySIGLEAvailable from TIB Hannover: RN 4052(93793) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
Les cartes sont les plongements, sans intersection d'arêtes, des graphes dans des surfaces. Les cart...
Contents Preface vii 1 Introduction to Polyhedral Meshes 1 1.1 SimplicialComplexes....................
The last decades have seen an extremely fruitful interplay between Riemann surfaces and graphs with ...
Abstract:- For a pair of vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a...
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinati...
ABSTRACT. We show that for a surface Σ, the subgraph of the pants graph determined by fixing a colle...
. The use of plane tessellations by hexagons facilitates the study of a family of triple loop digrap...
In this work, we study the cellular decomposition of S induced by a filling pair of curves v and w, ...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
Abstract: A graph G is said to be pancyclic if it contains cycles of all lengths from 4 to |V (G) | ...
[[abstract]]For two vertices X, Y ∈ V (G), a cycle is called a geodesic cycle with X and Y if a shor...
The divisor theories on finite graphs and metric graphs were introduced systematically as analogues ...
AbstractLetG=(V, E) be an Eulerian graph embedded on a triangulizable surfaceS. We show thatEcan be ...
A combinatorial map is the embedding of a graph on a surface (orientable or not), considered up to d...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
Les cartes sont les plongements, sans intersection d'arêtes, des graphes dans des surfaces. Les cart...
Contents Preface vii 1 Introduction to Polyhedral Meshes 1 1.1 SimplicialComplexes....................
The last decades have seen an extremely fruitful interplay between Riemann surfaces and graphs with ...
Abstract:- For a pair of vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a...
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinati...
ABSTRACT. We show that for a surface Σ, the subgraph of the pants graph determined by fixing a colle...
. The use of plane tessellations by hexagons facilitates the study of a family of triple loop digrap...
In this work, we study the cellular decomposition of S induced by a filling pair of curves v and w, ...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
Abstract: A graph G is said to be pancyclic if it contains cycles of all lengths from 4 to |V (G) | ...
[[abstract]]For two vertices X, Y ∈ V (G), a cycle is called a geodesic cycle with X and Y if a shor...
The divisor theories on finite graphs and metric graphs were introduced systematically as analogues ...
AbstractLetG=(V, E) be an Eulerian graph embedded on a triangulizable surfaceS. We show thatEcan be ...
A combinatorial map is the embedding of a graph on a surface (orientable or not), considered up to d...
[[abstract]]A shortest path connecting two vertices u and v is called a u-v geodesic. The distance b...
Les cartes sont les plongements, sans intersection d'arêtes, des graphes dans des surfaces. Les cart...
Contents Preface vii 1 Introduction to Polyhedral Meshes 1 1.1 SimplicialComplexes....................