- Tytuł:
- On k-intersection edge colourings
- Autorzy:
-
Muthu, Rahul
Narayanan, N.
Subramanian, C. - Powiązania:
- https://bibliotekanauki.pl/articles/744421.pdf
- Data publikacji:
- 2009
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph theory
k-intersection edge colouring
probabilistic method - Opis:
-
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ₖ(Δ) = max_{G : Δ(G) = Δ} {χ'ₖ(G)}$.
We show that fₖ(Δ) = Θ(Δ²/k). We also discuss some open problems. - Źródło:
-
Discussiones Mathematicae Graph Theory; 2009, 29, 2; 411-418
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł