A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H. A geometric graph is a simple graph G... Show more

July 10, 2015

Loading full text...

Similar articles

Loading recommendations...

x1

Homomorphic Preimages of Geometric Cycles

Click on play to start listening