Edge weights and vertex colours
By M. Karonski, Tomasz Łuczak, Andrew G. Thomason. 2004
376 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/06f90f97aac0e888ad957f5f36e841c6687541e5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Discrete Mathematics and Combinatorics
In Geometry and Topology
Citations in the corpus
- The local metric dimension of a graph (2010, background): “If distinct vertices have distinct labels, then c is a vertex-distinguishing edge coloring (see [3], [14] for example); while if every two adjacent vertices have distinct labels, then c is a neighbor-distinguishing edge coloring (see [2], [16] for example).”
- On vertex-coloring 13-edge-weighting (2008, methodology): “[3] that there exists a vertex coloring 3-edge-weighting.”