Premium
Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
Author(s) -
Hilton A. J. W.
Publication year - 1975
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/s2-12.1.123
Subject(s) - multigraph , vertex (graph theory) , combinatorics , citation , reading (process) , mathematics , information retrieval , computer science , library science , philosophy , graph , linguistics