Small forbidden configurations. III.
Anstee, R.P., Kamoosi, N. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Achromatic number of for small ”
Small forbidden configurations. III.
Fans and bundles in the graph of pairwise sums and products.
Halbeisen, Lorenz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Total 4-choosability of series-parallel graphs.
Woodall, Douglas R. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Circular chromatic index of generalized Blanuša snarks.
Ghebleh, Mohammad (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edge-Colourings of Permutation Graphs
Bohdan Zelinka (1973)
Matematický časopis
Similarity:
On the upper and lower chromatic numbers of BSQSs(16).
Lo Faro, Giovanni, Milazzo, Lorenzo, Tripodi, Antoinette (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multicoloured Hamilton cycles.
Albert, Michael, Frieze, Alan, Reed, Bruce (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on edge-colourings avoiding rainbow and monochromatic .
Jungić, Veselin, Kaiser, Tomás, Král', Daniel (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On k-intersection edge colourings
Rahul Muthu, N. Narayanan, C.R. Subramanian (2009)
Discussiones Mathematicae Graph Theory
Similarity:
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 . We show that fₖ(Δ) = Θ(Δ²/k). We also discuss some open problems.