Autor:	Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce Reed, Andrew Thomason
Předmět:	CHARTS diagrams etc. COLOR STATISTICAL weighting GRAPHIC methods
Zdroj:	Combinatorica; Feb2007, Vol. 27 Issue 1, p1-12, 12p
Abstrakt:	A weightingwof the edges of a graphGinduces a colouring of the vertices ofGwhere the colour of vertexv, denotedcv, is$$ {\sum\nolimits_{e \mathrel\backepsilon v} {w{\left( e \right)}} } $$. We show that the edges of every graph that does not contain a component isomorphic toK2can be weighted from the set {1, . . . ,30} such that in the resulting vertex-colouring ofG, for every edge (u,v) ofG,cu?cv. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink