On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte 论文
1979Proceedings of the London Mathematical Society引用 235
Graph Labeling and Dimension Problemsgraph theory and CDMA systemsAdvanced Graph Theory Research
摘要
It is well known that the Petersen graph is not 3-edge-colourable; that is, if we regard its 1-factors as (0, l)-functions on the set of edges, the constant function 1 cannot be obtained by adding some of them together. In fact, 1 cannot be obtained even if we permit subtraction as well. Here