Geodesic
Uniquely Line Colorable Graphs
Canadian mathematical bulletin, Tome 16 (1973) no. 4, pp. 525-529

Voir la notice de l'article provenant de la source Cambridge University Press

A line-coloring of a graph G is an assignment of colors to the lines of G so that adjacent lines are colored differently; an n-line coloring uses n colors. The line-chromatic number χ'(G) is the smallest n for which G admits an n-line coloring. 
Greenwell, D. L.; Kronk, H. V. Uniquely Line Colorable Graphs. Canadian mathematical bulletin, Tome 16 (1973) no. 4, pp. 525-529. doi: 10.4153/CMB-1973-086-2
@article{10_4153_CMB_1973_086_2,
     author = {Greenwell, D. L. and Kronk, H. V.},
     title = {Uniquely {Line} {Colorable} {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {525--529},
     year = {1973},
     volume = {16},
     number = {4},
     doi = {10.4153/CMB-1973-086-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-086-2/}
}
TY  - JOUR
AU  - Greenwell, D. L.
AU  - Kronk, H. V.
TI  - Uniquely Line Colorable Graphs
JO  - Canadian mathematical bulletin
PY  - 1973
SP  - 525
EP  - 529
VL  - 16
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-086-2/
DO  - 10.4153/CMB-1973-086-2
ID  - 10_4153_CMB_1973_086_2
ER  - 
%0 Journal Article
%A Greenwell, D. L.
%A Kronk, H. V.
%T Uniquely Line Colorable Graphs
%J Canadian mathematical bulletin
%D 1973
%P 525-529
%V 16
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-086-2/
%R 10.4153/CMB-1973-086-2
%F 10_4153_CMB_1973_086_2

[1] 1. Bosak, J., Hamiltonian lines in cubic graphs, Theory of Graphs (International Symposium, Rome, July 1966), Gordon and Breach, New York, (1967), 35–46. Google Scholar

[2] 2. Cartwright, D. and Harary, F., On the coloring of signed graphs, Elem. Math. 23 (1968), 85–89. Google Scholar

[3] 3. Chartrand, G. and Geller, D. P., On uniquely colorable planar graphs, J. Combinatorial Theory, 6 (1969), 271–278. Google Scholar

[4] 4. Harary, F., Hedetniemi, S. T., and Robinson, R. W., Uniquely Colorable Graphs, J. Combinatorial Theory, 6 (1969), 271–278. Google Scholar

[5] 5. Harary, F., Errata, J. Combinatorial Theory, 9 (1970), p. 221. Google Scholar

[6] 6. Vizing, V. G., A bound on the chromatic class of a p-graph, Diskret Analiz., 3 (1964), 25–30. Google Scholar

Cité par Sources :