Geodesic
Uniquely edge colourable graphs
Mathematica slovaca, Tome 34 (1984) no. 2, pp. 205-216
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C15 
@article{MASLO_1984_34_2_a9,
     author = {Bos\'ak, Juraj},
     title = {Uniquely edge colourable graphs},
     journal = {Mathematica slovaca},
     pages = {205--216},
     year = {1984},
     volume = {34},
     number = {2},
     mrnumber = {744955},
     zbl = {0599.05023},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1984_34_2_a9/}
}
TY  - JOUR
AU  - Bosák, Juraj
TI  - Uniquely edge colourable graphs
JO  - Mathematica slovaca
PY  - 1984
SP  - 205
EP  - 216
VL  - 34
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1984_34_2_a9/
LA  - en
ID  - MASLO_1984_34_2_a9
ER  - 
%0 Journal Article
%A Bosák, Juraj
%T Uniquely edge colourable graphs
%J Mathematica slovaca
%D 1984
%P 205-216
%V 34
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1984_34_2_a9/
%G en
%F MASLO_1984_34_2_a9
Bosák, Juraj. Uniquely edge colourable graphs. Mathematica slovaca, Tome 34 (1984) no. 2, pp. 205-216. http://geodesic.mathdoc.fr/item/MASLO_1984_34_2_a9/

[1] BOLLOBÁS B.: Extremal graph theory. Academic Press, London 1978. | MR

[2] BOSÁK J.: Hamiltonian lines in cubic graphs. In: Théorie des graphes (Proc. Symp. Rome 1966). Dunod, Paris 1967, 35-46. | MR

[3] BOSÁK J.: Enumeration of uniquely edge colourable multigraphs. In: Graphs and other combinatorial topics (Proc. Symp. Prague 1982). Teubner, Leipzig 1984, to appear. | MR

[4] COMTET L.: Analyse combinatoire. I. Press Univ. de France, Paris 1970. | MR

[5] FIORINI S.: On the chromatic index of a graph. III. Uniwuely edge-colourable graphs. Ouart. J. Math. Oxford (3), 26, 1975, 129-140. | MR | Zbl

[6] FIORINI S.: Un grafo cubico, non-planare, unicamente tricolorabile, di vita 5. Calcolo 13, 1976, 105-108. | MR | Zbl

[7] FIORINI S., WILSON R. J.: Edge colourings of graphs. Pitman, London 1977. | MR | Zbl

[8] GREENWELL D. L., KRONK H. V.: Uniquely line colorable graphs. Canad. Math. Bull. 16 (4), 1973, 525-529. | MR | Zbl

[9] HALL M., Jr.: Combinatorial theory. Blaisdell, Waltham, Mass. 1967. | MR | Zbl

[10] IZBICKI H.: Zulässige Kantenfärbungen von pseudo-regulären Graphen 3. Grades mit der Kantenfarbenzahl 3. Monatsh. Math. 66, 1962, 424-430. | MR | Zbl

[11] IZBICKI H.: Zulässige Kantenfärbungen von pseudo-regulären Graphen mit minimalen Kanten-farbenzahl. Monatsh. Math. 67, 1963, 25-31. | MR

[12] NINČÁK J.: Hamiltonian circuits in cubic graphs. Comm. Math. Univ. Carol. 15, 1974, 627-630. | MR

[13] THOMASON A. G.: Hamiltonian cycles and uniquely edge colourable graphs. In: Advances in Graph Theory, Ann. Discr. Math. 3. North-Holland, Amsterdam 1978, 259-268. | MR | Zbl

[14] THOMASON A. G.: Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable. J. Graph Theory 6, 1982, 219-221. | MR | Zbl

[15] TUTTE W. T.: Hamiltonian circuits. In: Colloquio Internazionale sulle Teorie Combinatoire, Atti Convegni Liпcei 17. Accad. Naz. Lincei, Roma 1976, 193-199. | MR | Zbl

[16] WILSON R. J.: Problem 2. In: Proc. Fifth British Cornbinatorial Conf. Utilitas Math., Winnipeg 1976, 696.

[17] WILSON R. J.: Edge-colourings of graphs - a survey. In: Theory and applications of graphs (Proc. Conf. Kalamazoo 1976). Springer, Berlin 1978, 608-619. | MR