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...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Cockburn, Sally
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 10.07.2015
Subjects
Online AccessGet full text

Cover

Loading…