Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
Stefan Felsner, Clemens Huemer, Sarah Kappes, Davi...
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...