Displaying similar documents to “More constructions for Turan's (3,4)-conjecture.”

A lower bound for the packing chromatic number of the Cartesian product of cycles

Yolandé Jacobs, Elizabeth Jonck, Ernst Joubert (2013)

Open Mathematics

Similarity:

Let G = (V, E) be a simple graph of order n and i be an integer with i ≥ 1. The set X i ⊆ V(G) is called an i-packing if each two distinct vertices in X i are more than i apart. A packing colouring of G is a partition X = {X 1, X 2, …, X k} of V(G) such that each colour class X i is an i-packing. The minimum order k of a packing colouring is called the packing chromatic number of G, denoted by χρ(G). In this paper we show, using a theoretical proof, that if q = 4t, for some integer t...