✦ LIBER ✦

Further remarks on partitioning the edges of a graph

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

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 80 KB
Volume: 24
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(78)90029-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning the edges of a graph

✍ A.J.W Hilton; Rhys Price Jones 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 247 KB

On partitioning the edges of graphs into

On partitioning the edges of graphs into connected subgraphs

✍ M. Jünger; G. Reinelt; W. R. Pulleyblank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 559 KB

For any positive integer s, an s-partition of a graph G = ( ! -( €I is a partition of E into El U E2 U U E k, where 14 = s for 1 I i 5 k -1 and 1 5 1 4 1 5 s and each €; induces a connected subgraph of G. We prove (i) if G is connected, then there exists a 2-partition, but not neces-(ii) if G is 2-e

Eigenvalues and partitionings of the edg

Eigenvalues and partitionings of the edges of a graph

✍ A.J. Hoffman 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Coloring the Edges of a Complete Graph

✍ Annamaria G. Varga 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

On the time to traverse all edges of a g

On the time to traverse all edges of a graph

✍ David Zuckerman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 293 KB

On decomposition of r-partite graphs int

On decomposition of r-partite graphs into edge-disjoint hamilton circuits

✍ Renu Laskar; Bruce Auerbach 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Let It'Qn; r) denote the complete s-partite graph Kin, n, '.., n). it is shown hzre that for all even n(r -I) 2, Kfn; P) is the union of n(r -'I)/2 of its Hamilton circrlits which are mutually edge-disjoint, and for all odd nfr -1) 3 1, K(n; P) is the union of b(P -f) -r,,rs f l t ii o I s amilton c