A relaxed case on 1-2-3 conjecture
From MaRDI portal
Publication:2631083
DOI10.1007/s00373-015-1656-9zbMath1342.05038OpenAlexW2300562719WikidataQ123140027 ScholiaQ123140027MaRDI QIDQ2631083
Jian Liang Wu, Guang-Hui Wang, Yu-ping Gao
Publication date: 28 July 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1656-9
Related Items
Neighbour-distinguishing labellings of families of graphs, Neighbour-distinguishing labellings of powers of paths and powers of cycles, Neighbour sum distinguishing edge-weightings with local constraints, A notion of vertex equitability for proper labellings, On inducing degenerate sums through 2-labellings, A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs, Further evidence towards the multiplicative 1-2-3 conjecture
Cites Work
- Unnamed Item
- Multiplicative vertex-colouring weightings of graphs
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- On vertex-coloring 13-edge-weighting
- A new type of edge-derived vertex coloring
- On the maximum average degree and the oriented chromatic number of a graph
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Vertex colouring edge partitions
- Bounding the weight choosability number of a graph