Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

On k-intersection edge colourings

Rahul MuthuN. NarayananC.R. Subramanian — 2009

Discussiones Mathematicae Graph Theory

We propose the following problem. For some k ≥ 1, a graph G is to be properly edge coloured such that any two adjacent vertices share at most k colours. We call this the k-intersection edge colouring. The minimum number of colours sufficient to guarantee such a colouring is the k-intersection chromatic index and is denoted χ’ₖ(G). Let fₖ be defined by f ( Δ ) = m a x G : Δ ( G ) = Δ χ ' ( G ) . We show that fₖ(Δ) = Θ(Δ²/k). We also discuss some open problems.

Page 1

Download Results (CSV)