Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights

Let $G$ be a graph and $\mathcal{S}$ be a subset of $Z$. A vertex-coloring $\mathcal{S}$-edge-weighting of $G$ is an assignment of weights by the elements of $\mathcal{S}$ to each edge of $G$ so that adjacent vertices have different sums of incident edges weights. It was proved that every 3-connecte...

Full description

Bibliographic Details

Published in:	Discrete Mathematics & Theoretical Computer Science
Main Author:	Hongliang Lu
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2016-01-01
Subjects:	2-connected bipartite grap edge-weighting vertex-coloring [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/2162/pdf