On the complexity of vertex-coloring edge-weightingsArticle
Authors: Andrzej Dudek 1; David Wajc 2
NULL##NULL
Andrzej Dudek;David Wajc
1 Department of Mathematics [Kalamazoo]
2 Department of Computer Science [Haifa]
Given a graph G = (V; E) and a weight function omega : E -\textgreater R, a coloring of vertices of G, induced by omega, is defined by chi(omega) (nu) = Sigma(e(sic)nu) omega (e) for all nu is an element of V. In this paper, we show that determining whether a particular graph has a weighting of the edges from \1, 2\ that induces a proper vertex coloring is NP-complete.
Jakub Przybyło;Fan Wei, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, On asymptotic confirmation of the Faudree-Lehel Conjecture on the irregularity strength of graphs, pp. 766-773, 2023, Prague, Czech Republic, 10.5817/cz.muni.eurocomb23-106.
Mingyue Xiao;Jihui Wang, 2022 International Symposium on Intelligent Robotics and Systems (ISoIRS), The Adjacent Vertex Sum Distinguishing Coloring of the Join and Cartesian Product of Some Digraphs, pp. 143-147, 2022, Chengdu, China, 10.1109/isoirs57349.2022.00036.
Julien Bensmail;Fionn Mc Inerney;Kasper Szabo Lyngsie, 2019, On {a,b}-edge-weightings of bipartite graphs with odd a,b, Discussiones Mathematicae Graph Theory, 42, 1, pp. 159, 10.7151/dmgt.2250, https://doi.org/10.7151/dmgt.2250.
Olivier Baudon;Julien Bensmail;Tom Davot;Hervé Hocquard;Jakub Przybyło;et al., 2019, A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions, Discrete Mathematics & Theoretical Computer Science, vol. 21 no. 1, ICGT 2018, 10.23638/dmtcs-21-1-2, https://doi.org/10.23638/dmtcs-21-1-2.
Atílio G. Luiz;C. N. Campos, Anais do II Encontro de Teoria da Computação (ETC 2017), The 1,2,3-Conjecture for powers of paths and powers of cycles, pp. 41-44, 2017, Brasil, 10.5753/etc.2017.3187.
Hongliang Lu, 2016, Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights, Discrete Mathematics & Theoretical Computer Science, Vol. 17 no. 3, Graph Theory, 10.46298/dmtcs.2162, https://doi.org/10.46298/dmtcs.2162.