Browsing Mathematics (Faculty of) by Subject "homomorphism"
Now showing items 1-2 of 2
-
Complexity of Ck-Coloring in Hereditary Classes of Graphs
(Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019)For a graph F, a graph G is F-free if it does not contain an induced subgraph isomorphic to F. For two graphs G and H, an H-coloring of G is a mapping f : V (G) --> V (H) such that for every edge uv E(G) it holds that ... -
Density and Structure of Homomorphism-Critical Graphs
(University of Waterloo, 2018-08-22)Let $H$ be a graph. A graph $G$ is $H$-critical if every proper subgraph of $G$ admits a homomorphism to $H$, but $G$ itself does not. In 1981, Jaeger made the following conjecture concerning odd-cycle critical graphs: ...