ON THE CHROMATIC INDEX OF A GRAPH, III: UNIQUELY EDGE-COLOURABLE GRAPHS
ON THE CHROMATIC INDEX OF A GRAPH, III: UNIQUELY EDGE-COLOURABLE GRAPHS
复制标题
DOI:
10.1093/qmath/26.1.129
复制
发表时间:
1975
影响因子:
0.7
通讯作者:
S. Fiorini
中科院分区:
文献类型:
--
作者:
S. Fiorini
THE motivation for looVbu $ at uniquely edge-colourable giaphs comes from the relationship they have to edge-critica,) graphs. These have been the object of study of the two earlier papers\if" and (5) written jointly with RJ Wilson. Edge critical graphs emerge naturally from the classification problem arising from the following theorem of Vizing (10):