✦ LIBER ✦

Channel assignment on graphs of bounded treewidth

✍ Scribed by Colin McDiarmid; Bruce Reed

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 211 KB
Volume: 273
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00236-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Channel Assignment on Nearly Bipartite a

Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs

✍ Colin McDiarmid; Bruce Reed 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 190 KB

On bounded treewidth duality of graphs

✍ Ne?et?il, Jaroslav; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 734 KB

For a graph H , the H-coloring problem is to decide whether or not an instance graph G is homomorphic to H . The H-coloring problem is said to have bounded treewidth duality if there is an integer k such that for any graph G which is not homomorphic to H , there is a graph F of treewidth k which is

Channel assignment on Cayley graphs

✍ Patrick Bahls 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

We address various channel assignment problems on the Cayley graphs of certain groups, computing the frequency spans by applying group theoretic techniques. In particular, we show that if G is the Cayley graph of an n-generated group with a certain kind of presentation, then (G; k, 1) ≤ 2(k +n-1). F

A spectral lower bound for the treewidth

A spectral lower bound for the treewidth of a graph and its consequences

✍ L.Sunil Chandran; C.R. Subramanian 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 95 KB

We give a lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. We use this lower bound to show that the treewidth of a d-dimensional hypercube is at least 3 We generalize this result to Hamming graphs. We also observe that every graph G on n v

On bounded automorphisms of locally fini

On bounded automorphisms of locally finite transitive graphs

✍ Niemeyer, Peter 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co

A note on bounded automorphisms of infin

A note on bounded automorphisms of infinite graphs

✍ Chris D. Godsil; Wilfried Imrich; Norbert Seifter; Mark E. Watkins; Wolfgang Woe 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 439 KB