𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classic Papers in Combinatorics || On Colouring the Nodes of a Network

✍ Scribed by Gessel, Ira; Rota, Gian-Carlo

Book ID
120340522
Publisher
Birkhäuser Boston
Year
2009
Weight
1005 KB
Category
Article
ISBN
0817648429

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on the Combinatorics of Multiplic
A Note on the Combinatorics of Multiplication in Groups
✍ A. Juhász; A. Leibman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 111 KB

Let S be a finite subset of a group G, |S| = n, and let g ∈ S • S. Then g induces a partial function λ g : S → S by λ g (s) = t if and only if st = g and λ g (s) is not defined if g ∈ sS. For every g ∈ S • S, λ g is a one-to-one mapping. In this note we describe the groups which have a finite genera

Trade-offs on the location of the core n
Trade-offs on the location of the core node in a network
✍ Jean-François Macq; Michel X. Goemans 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract We consider the problem of selecting a core node in a network under two potentially competing criteria, one being the sum of the distances to a set of terminals, the other being the cost of connecting this core node and the terminals with a Steiner tree. We characterize the worst‐case t