𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithmic graph theory and perfect graphs

✍ Scribed by Rolf H. Möhring

Publisher
Springer Netherlands
Year
1986
Tongue
English
Weight
81 KB
Volume
3
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalization of perfect graphs?i-per
A generalization of perfect graphs?i-perfect graphs
✍ Cai, Leizhen; Corneil, Derek 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 1003 KB

Let i be a positive integer. We generalize the chromatic number x ( G ) of G and the clique number w(G) of G as follows: The i-chromatic number of G , denoted by x Z ( G ) , is the least number k for which G has a vertex partition V,, V,, . . . , Vk: such that the clique number of the subgraph induc

Algorithmic theory of random graphs
Algorithmic theory of random graphs
✍ Alan Frieze; Colin McDiarmid 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB 👁 2 views

The theory of random graphs has been mainly concerned with structural w x properties, in particular the most likely values of various graph invariantsᎏsee Bollobas 21 . There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this pap