𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complete partitions of graphs

✍ Scribed by Magnús M. Halldórsson; Guy Kortsarz; Jaikumar Radhakrishnan; Sivaramakrishnan Sivasubramanian

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
393 KB
Volume
27
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge domination in complete partite grap
Edge domination in complete partite graphs
✍ Bor-Liang Chen; Hung-Lin Fu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 416 KB

An edge dominating set in a graph G is a set of edges D such that every edge not in D is adjacent to an edge of D. An edge domatic partition of a graph C=(V, E) is a collection of pairwise-disjoint edge dominating sets of G whose union is E. The maximum size of an edge domatic partition of G is call

Covering the complete graph by partition
Covering the complete graph by partitions
✍ Zoltán Füredi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 530 KB

A (D, c)-coloring of the complete graph K" is a coloring of the edges with c colors such that all monochromatic connected subgraphs have at most D vertices. Resolvable block designs with c parallel classes and with block size D are natural examples of (D, c)-colorings. However, (D, c)-colorings are