On Proper Labellings of Graphs with Minimum Label Sum
From MaRDI portal
Recommendations
Cites work
- Edge weights and vertex colours
- Edge weights and vertex colours: minimizing sum count
- Equitable neighbour-sum-distinguishing edge and total colourings
- Graph theory
- How to Define an Irregular Graph
- Minimum-weight triangulation is NP-hard
- On minimizing the maximum color for the 1-2-3 conjecture
- On proper labellings of graphs with minimum label sum
- On the complexity of vertex-coloring edge-weightings
- The 1-2-3 conjecture almost holds for regular graphs
- The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
- Vertex-coloring edge-weightings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
Cited in
(8)- Further results on an equitable 1-2-3 conjecture
- On proper labellings of graphs with minimum label sum
- Going wide with the 1-2-3 conjecture
- On the role of 3s for the 1-2-3 conjecture
- On the role of 3's for the 1-2-3 conjecture
- scientific article; zbMATH DE number 5873436 (Why is no real title available?)
- Starter labelling of \(k\)-windmill graphs with small defects
- A notion of vertex equitability for proper labellings
This page was built for publication: On Proper Labellings of Graphs with Minimum Label Sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041179)