Back to Search
Start Over
Vertex-Colouring Edge-Weightings.
- Source :
- Combinatorica; Feb2007, Vol. 27 Issue 1, p1-12, 12p
- Publication Year :
- 2007
-
Abstract
- A weightingwof the edges of a graphGinduces a colouring of the vertices ofGwhere the colour of vertexv, denotedc<subscript>v</subscript>, 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 toK<subscript>2</subscript>can be weighted from the set {1, . . . ,30} such that in the resulting vertex-colouring ofG, for every edge (u,v) ofG,c<subscript>u</subscript>?c<subscript>v</subscript>. [ABSTRACT FROM AUTHOR]
- Subjects :
- CHARTS, diagrams, etc.
COLOR
STATISTICAL weighting
GRAPHIC methods
Subjects
Details
- Language :
- English
- ISSN :
- 02099683
- Volume :
- 27
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Combinatorica
- Publication Type :
- Academic Journal
- Accession number :
- 24196912
- Full Text :
- https://doi.org/10.1007/s00493-007-0041-6