Homomorphic Preimages of Geometric Cycles
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 together with a straight line...
Saved in:
Published in | arXiv.org |
---|---|
Main Author | |
Format | Paper Journal Article |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
10.07.2015
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!