A relaxed case on 1-2-3 conjecture
From MaRDI portal
Publication:2631083
Recommendations
Cites work
- A new type of edge-derived vertex coloring
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- Bounding the monomial index and (1,l)-weight choosability of a graph
- Degree constrained subgraphs
- Edge weights and vertex colours
- Graph theory
- Multiplicative vertex-colouring weightings of graphs
- On the maximum average degree and the oriented chromatic number of a graph
- On vertex-coloring 13-edge-weighting
- Vertex colouring edge partitions
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Vertex-colouring edge-weightings
Cited in
(12)- 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
- Neighbour-distinguishing labellings of families of graphs
- Neighbour-distinguishing labellings of powers of paths and powers of cycles
- A note on 1-2-3 conjecture for Halin graphs
- On the 1-2-3-conjecture
- Neighbour sum distinguishing edge-weightings with local constraints
- A notion of vertex equitability for proper labellings
- On inducing degenerate sums through 2-labellings
- A solution to the 1-2-3 conjecture
- On a graph labelling conjecture involving coloured labels
- Some remarks and results on the standard (2,2)-conjecture
This page was built for publication: A relaxed case on 1-2-3 conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631083)
