Partitioning the edges of a graph
Copyright policy )Partitioning the edges of a graph
AbstractFor any integer m (≥2), it is known that there are simple graphs of maximum valence m whose edges cannot be coloured with m colours in such a way that adjacent edges shall have different colours. We find those values of m and k for which it is true that every simple graph whose maximum valence does not exceed mk can be coloured with m colours in such a way that no colour appears more than k times at any vertex.
colouring, Coloring of graphs and hypergraphs, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, edge partition graph, Theoretical Computer Science
colouring, Coloring of graphs and hypergraphs, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, edge partition graph, Theoretical Computer Science
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!