Vertex-coloring graphs with 4-edge-weightings
From MaRDI portal
(Redirected from Publication:6081387)
Abstract: An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that for every graph without isolated edge, a vertex-coloring edge-weighting with the set {1,2,3} exists. In this note, we show that the statement is true for the weight set {1,2,3,4}.
An edge-weighting of a graph is called vertex coloring if the weighted degrees yield a proper vertex coloring of the graph. It has been conjectured that for every graph without an isolated edge, a vertex-coloring edge-weighting with the set \(\{1, 2, 3\}\) exists. The paper shows that the statement is true for the weight set \(\{1, 2, 3, 4\}\). The proof is based on the max flow -- min cut theorem.
Recommendations
- Vertex-coloring edge-weightings of graphs
- Vertex coloring edge-weighted digraphs
- scientific article; zbMATH DE number 7426494
- Vertex-coloring 3-edge-weighting of some graphs
- Vertex coloring of graphs by total 2-weightings
- scientific article; zbMATH DE number 6004918
- Vertex-colouring edge-weightings with two edge weights
- Vertex-colouring edge-weightings
Cited in
(7)- A solution to the 1-2-3 conjecture
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- Combinatorial spectra using polynomials.
- The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
- The 1-2 conjecture holds for regular graphs
- On asymptotic confirmation of the Faudree-Lehel conjecture on the irregularity strength of graphs (extended abstract)
- Locally irregular total colorings of graphs
This page was built for publication: Vertex-coloring graphs with 4-edge-weightings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081387)
