✦ LIBER ✦

List Homomorphisms and Circular Arc Graphs

✍ Scribed by Tomas Feder; Pavol Hell; Jing Huang

Book ID: 106167951
Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 326 KB
Volume: 19
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004939970003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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__),

List Homomorphisms to Reflexive Graphs

✍ Tomas Feder; Pavol Hell 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 334 KB

Let H be a fixed graph. We introduce the following list homomorphism problem: Given an input graph G and for each vertex v of G a ``list'' L(v) V(H), decide whether or not there is a homomorphism f : We discuss this problem primarily in the context of reflexive graphs, i.e., graphs in which each ve

On powers of circular arc graphs and pro

On powers of circular arc graphs and proper circular arc graphs

✍ Carsten Flotow 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 537 KB

Algorithms on circular-arc graphs

✍ F. Gavril 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 596 KB

Interval bigraphs and circular arc graph

Interval bigraphs and circular arc graphs

✍ Pavol Hell; Jing Huang 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract We prove that the complements of interval bigraphs are precisely those circular arc graphs of clique covering number two, which admit a representation without two arcs covering the whole circle. We give another characterization of interval bigraphs, in terms of a vertex ordering, that w

Independence and graph homomorphisms gra

Independence and graph homomorphisms graph homomorphisms

✍ Michael O. Albertson; Lily Chan; Ruth Haas 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB

## Abstract A graph with __n__ vertices that contains no triangle and no 5‐cycle and minimum degree exceeding __n__/4 contains an independent set with at least (3__n__)/7 vertices. This is best possible. The proof proceeds by producing a homomorphism to the 7‐cycle and invoking the No Homomorphism