𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

✍ Scribed by Raffaele Mosca

Publisher
Springer Japan
Year
2001
Tongue
English
Weight
134 KB
Volume
17
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering the Edges of a Graph by a Presc
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap
✍ Noga Alon; Yair Caro; Raphael Yuster πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 360 KB

Let H=(V H , E H ) be a graph, and let k be a positive integer. A graph G=(V G , E G ) is H-coverable with overlap k if there is a covering of the edges of G by copies of H such that no edge of G is covered more than k times. Denote by overlap(H, G) the minimum k for which G is H-coverable with over

Clique coverings of the edges of a rando
Clique coverings of the edges of a random graph
✍ BΓ©la BollobΓ‘s; Paul ErdΕ‘s; Joel Spencer; Douglas B. West πŸ“‚ Article πŸ“… 1993 πŸ› Springer-Verlag 🌐 English βš– 293 KB
A polynomial algorithm for the minimum w
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
✍ Wen-Lian HSU; George L. Nemhauser πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection