Vertex-coloring 2-edge-weighting of graphs
From MaRDI portal
Publication:607360
DOI10.1016/j.ejc.2010.08.002zbMath1203.05056arXiv1007.1505OpenAlexW1983401788MaRDI QIDQ607360
Cun-Quan Zhang, Qinglin Yu, Hongliang Lu, Xu Yang
Publication date: 22 November 2010
Published in: European Journal of Combinatorics, Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.1505
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)
Related Items (18)
Group sum chromatic number of graphs ⋮ Vertex-coloring 3-edge-weighting of some graphs ⋮ Neighbour-distinguishing labellings of families of graphs ⋮ The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture ⋮ Graphs with vertex-coloring and detectable 2-edge-weighting ⋮ An injective version of the 1-2-3 conjecture ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles ⋮ On the total versions of 1-2-3-conjecture for graphs and hypergraphs ⋮ Neighbour sum distinguishing edge-weightings with local constraints ⋮ On total weight choosability of graphs ⋮ Total weight choosability of Cartesian product of graphs ⋮ Permanent index of matrices associated with graphs ⋮ Graphs with multiplicative vertex-coloring 2-edge-weightings ⋮ Equitable neighbour-sum-distinguishing edge and total colourings ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Total weight choosability for Halin graphs ⋮ On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\) ⋮ On proper labellings of graphs with minimum label sum
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- On vertex-coloring 13-edge-weighting
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Vertex colouring edge partitions
- Vertex-distinguishing proper edge-colorings
- The Harmonious Chromatic Number of Bounded Degree Graphs
- Vertex-distinguishing edge colorings of graphs
This page was built for publication: Vertex-coloring 2-edge-weighting of graphs