The Quest for A Characterization of Hom-Properties of Finite Character

The Quest for A Characterization of Hom-Properties of Finite Character

A graph property is a set of (countable) graphs. A homomorphism from a graph G to a graph H is an edge-preserving map from the vertex set of G into the vertex set of H; if such a map exists, we write G → H. Given any graph H, the hom-property →H is the set of H-colourable graphs, i.e., the set of al...

Full description

Bibliographic Details
Main Authors: Broere Izak, Matsoha Moroli D.V., Heidema Johannes
Format: Article
Language:English
Published: Sciendo 2016-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
(countable) graph
homomorphism (of graphs)
property of graphs
hom-property
(finitely-)induced-hereditary property
finitely determined property
(weakly) finite character
axiomatizable property
compactness theorems
core
connectedness
chromatic number
clique number
independence number
dominating set
Online Access:https://doi.org/10.7151/dmgt.1873

Internet

https://doi.org/10.7151/dmgt.1873

Similar Items