Graphs with multiplicative vertex-coloring 2-edge-weightings
From MaRDI portal
Publication:512893
DOI10.1007/s10878-015-9966-7zbMath1358.05117OpenAlexW2189608989WikidataQ59609550 ScholiaQ59609550MaRDI QIDQ512893
Publication date: 3 March 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9966-7
Related Items (1)
Cites Work
- Unnamed Item
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Multiplicative vertex-colouring weightings of graphs
- On bounds for the product irregularity strength of graphs
- Vertex-coloring 2-edge-weighting of graphs
- Vertex-coloring edge-weightings of graphs
- Additive coloring of planar graphs
- 1,2 conjecture-the multiplicative version
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Lucky labelings of graphs
- Product irregularity strength of graphs
- Edge weights and vertex colours
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- Vertex colouring edge partitions
- Product irregularity strength of certain graphs
- Weight choosability of graphs
- Sequence variations of the 1-2-3 Conjecture and irregularity strength
This page was built for publication: Graphs with multiplicative vertex-coloring 2-edge-weightings