𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitioning the edges of a graph

✍ Scribed by A.J.W Hilton; Rhys Price Jones

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
247 KB
Volume
25
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Monochromatic cycle partitions of edge-c
Monochromatic cycle partitions of edge-colored graphs
✍ GΓ‘bor N. SΓ‘rkΓΆzy πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 88 KB πŸ‘ 1 views

In this article we study the monochromatic cycle partition problem for non-complete graphs. We consider graphs with a given independence number (G) = . Generalizing a classical conjecture of Erd" os, GyΓ‘rfΓ‘s and Pyber, we conjecture that if we r-color the edges of a graph G with (G) = , then the ver

Edge-connectivity in p-partite graphs
Edge-connectivity in p-partite graphs
✍ Lutz Volkmann πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 166 KB

Let G = (V, €1 be a finite, simple p-partite graph with minimum degree 6 and edge-connectivity A. It is proved that if IVI d (2pS)/(p -1) -2 or in special cases that if IVI I ( 2 p 6 ) / ( p -1) -1, then A = S . It is further shown that this result is best possible.

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