Graph homomorphisms and chromatic numbers are foundational concepts in modern graph theory, with widespread applications that extend from combinatorial optimisation to theoretical computer science. A ...

This is a preview. Log in through your library . Abstract Given d ∊ (0, ∞) let $k_{d}$ be the smallest integer k such that d < 2k log k. We prove that the ...

This paper proves that for any integer n ≥ 4 and any rational number r, 2 ≤ r ≤ n — 2, there exists a graph G which has circular chromatic number r and which does not contain Kn as a minor. Journal ...