𝔖 Bobbio Scriptorium
✦   LIBER   ✦

List homomorphisms of graphs with bounded degrees

✍ Scribed by Tomás Feder; Pavol Hell; Jing Huang

Book ID
108113573
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
171 KB
Volume
307
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of greedy algorithms on graphs
Analysis of greedy algorithms on graphs with bounded degrees
✍ Nicholas C. Wormald 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 370 KB

We give a general result on the average-case performance of certain greedy algorithms. These are derived from algorithms in which the possible operations performed at each step are prioritised. This type of prioritisation has occurred in previously studied heuristics for ÿnding large subgraphs with

Bi-arc graphs and the complexity of list
Bi-arc graphs and the complexity of list homomorphisms
✍ Tomas Feder; Pavol Hell; Jing Huang 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract Given graphs __G__, __H__, and lists __L__(__v__) ⊆ __V__(__H__), __v__ ε __V__(__G__), a list homomorphism of __G__ to __H__ with respect to the lists __L__ is a mapping __f__ : __V__(__G__) → __V__(__H__) such that __u__v ε __E__(__G__) implies __f__(__u__)__f__(__v__) ε __E__(__H__),

Judicious partitions of bounded-degree g
Judicious partitions of bounded-degree graphs
✍ B. Bollobás; A. D. Scott 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

## Abstract We prove results on partitioning graphs __G__ with bounded maximum degree. In particular, we provide optimal bounds for bipartitions __V__(__G__) = __V__~1~ ∪ __V__~2~ in which we minimize {__e__(__V__~1~), __e__(__V__~2~)}. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131–143, 200