Graphs with multiplicative vertex-coloring 2-edge-weightings
Work
Year: 2015
Type: article
Abstract: A k-weighting w of a graph is an assignment of an integer weight $$w(e)\in \{1,...k\}$$ to each edge e. Such an edge weighting induces a vertex coloring c defined by $$c(v)=\mathop {\displaystyle {\pr... more
Author Joanna Skowronek-Kaziów
Institution University of Zielona Góra
Cites: 21
Cited by: 3
Related to: 10
FWCI: 0.516
Citation percentile (by year/subfield): 58.07
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,990