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
β¦ LIBER β¦
Inequalities with respect to graph homomorphism
β Scribed by Huishan Zhou
- Book ID
- 103056973
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 184 KB
- Volume
- 112
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
If there is a homomorphism from a graph G onto a graph H, then there exist some inequalities relating 'the degree ratio' of the two graphs which have some interesting corollaries.
π SIMILAR VOLUMES
List Homomorphisms to Reflexive Graphs
β
Tomas Feder; Pavol Hell
π
Article
π
1998
π
Elsevier Science
π
English
β 334 KB
Counting Homomorphisms to Sparse Graphs
β
Jaroslav NeΕ‘etΕil; Patrice Ossona de Mendez
π
Article
π
2009
π
Elsevier Science
π
English
β 178 KB
Graph homomorphisms with infinite target
β
Gary MacGillivray
π
Article
π
1994
π
Elsevier Science
π
English
β 492 KB
Slepianβs inequality with respect to maj
β
Longxiang Fang; Xinsheng Zhang
π
Article
π
2011
π
Elsevier Science
π
English
β 207 KB
On graphs critical with respect to edge-
β
Hian Poh Yap
π
Article
π
1981
π
Elsevier Science
π
English
β 698 KB
Regular Graphs with No Homomorphisms ont
β
I.M. Wanless; N.C. Wormald
π
Article
π
2001
π
Elsevier Science
π
English
β 97 KB
We prove the existence of d-regular graphs with arbitrarily large girth and no homomorphism onto the cycle C s , where (d, s)=(3, 9) and (4, 5).