✦ LIBER ✦

Edge coloring a k-tree into two smaller trees

✍ Scribed by Chhajed, Dilip

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 56 KB
Volume: 29
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199707)29:4<191::aid-net1>3.0.co;2-a

No coin nor oath required. For personal study only.

✦ Synopsis

The problem of the edge coloring partial k-tree into two partial p-and q-trees with p, q õ k is considered. An algorithm is provided to construct such a coloring with p / q Å k. Usefulness of this result in a Lagrangian decomposition framework to solve certain combinatorial optimization problems is discussed.

📜 SIMILAR VOLUMES

Minimum augmentation of a tree to a K-ed

Minimum augmentation of a tree to a K-edge-connected graph

✍ Shuichi Ueno; Yoji Kajitani; Hajime Wada 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

Factoring, into Edge Transpositions of a

Factoring, into Edge Transpositions of a Tree, Permutations Fixing a Terminal Vertex

✍ John H. Smith 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 71 KB

If the symmetric group is generated by transpositions corresponding to the edges of a spanning tree we discuss identities they satisfy, including a set of defining relations. We further show that a minimal length factorization of a permutation fixing a terminal vertex does not involve the unique edg

Edge-decompositions of Kn,n into isomorp

Edge-decompositions of Kn,n into isomorphic copies of a given tree

✍ Anna Lladó; S.C. López 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

We study the Ha ¨ggkvist conjecture which states that, for each tree T with n edges, there is an edge-partition of the complete bipartite graph K n;n into n isomorphic copies of T . We use the concept of bigraceful labelings, introduced in [7], which give rise to cyclic decompositions of K n;n . Whe