On arc-coloring of digraphs

• Autorzy: Zwonek M.
• Języki publikacji: EN

Abstrakty

EN

In the paper we deal with the problem of the arc-colouring of some classes of digraphs (tournaments, complete digraphs and products of digraphs).

Słowa kluczowe

EN

arc-coloring; digraph

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2006
• Tom: Vol. 26, no. 1
• Strony: 185--195
• Opis fizyczny: Bibliogr. 8 poz., rys.

Twórcy

autor

Zwonek M.

• AGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Kraków, Poland,

Bibliografia

• [1] Behzad M., Graphs and their chromatic numbers, Doctoral Thesis Michigan State University, 1965.
• [2] Bollobas B., On generalized graphs, Acta Math. Acad. Sci. Hung. 16 (1965), 447-452.
• [3] El-Zahar M., Sauer N. W., The chromatic number of the product of two 4-chromatic graphs is 4, Combinatorica 5 (1985), 121-126.
• [4] Harner C. C, Entringer R. C, Arc Colorings of Digraphs, Journal of Combinatorial Theory (B) 13 (1972), 219-225.
• [5] Hedetniemi S.T., Homomorphisms of graphs and automata, Technical Report 03105-44-T, University of Michigan, 1966.
• [6] Poljak S., Rodl V., On the Arc-Chromatic Number of a Digraph, Journal of Combinatorial Theory (B) 31 (1981), 190-198.
• [7] West D. B., Introduction to Graph Theory, Prentice Hall N.J., 1996.
• [8] Zwonek M., Pseudototal colorings of digraphs, Discrete Mathematics 218 (2000), 253-263.