𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a problem concerning tolerance graphs

✍ Scribed by Thomas Andreae; Ulf Hennig; Andreas Parra

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
406 KB
Volume
46
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a routing and scheduling problem conc
On a routing and scheduling problem concerning multiple edge traversals in graphs
✍ G.W. Groves; J. le Roux; J.H. van Vuuren πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 189 KB

Practical vehicle routing problems generally have both routing and scheduling aspects to consider. However, few heuristic methods exist that address both these complicated aspects simultaneously. We present heuristics to determine an efficient circular traversal of a weighted graph that requires a s

On a problem of J. Zaks concerning 5-val
On a problem of J. Zaks concerning 5-valent 3-connected planar graphs
✍ Stanislav JendroΔΎ πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 385 KB

Recently J. Zaks formulated the following Eberhard-type problem: Let (Ps, P6 .... ) be a finite sequence of nonnegative integers; does there exist a 5-valent 3-connected planar graph G such that it has exactly Pk k-gons for all k ~> 5, m i of its vertices meet exactly i triangles, 4 ~< i <~ 5, and m

A note concerning asymmetric games on gr
A note concerning asymmetric games on graphs
✍ Alvin E. Roth πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 195 KB

## Abstract We consider a class of asymmetric two‐person games played on graphs, and characterize all the positions in the game.