On proper labellings of graphs with minimum label sum
From MaRDI portal
Publication:2118389
DOI10.1007/s00453-021-00903-xOpenAlexW3002080513MaRDI QIDQ2118389
Nicolas Nisse, Julien Bensmail, Foivos Fioravantes
Publication date: 22 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00903-x
Related Items (2)
On Proper Labellings of Graphs with Minimum Label Sum ⋮ On inducing degenerate sums through 2-labellings
Cites Work
- Unnamed Item
- Unnamed Item
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Vertex-coloring 2-edge-weighting of graphs
- Vertex-coloring edge-weightings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- A partial k-arboretum of graphs with bounded treewidth
- Equitable neighbour-sum-distinguishing edge and total colourings
- Edge weights and vertex colours
- On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)
- On minimizing the maximum color for the 1-2-3 conjecture
- The 1-2-3 conjecture almost holds for regular graphs
- Edge weights and vertex colours: minimizing sum count
- On decomposing regular graphs into locally irregular subgraphs
- How to Define an Irregular Graph
- Minimum-weight triangulation is NP-hard
- On neighbour sum-distinguishing $\{0,1\}$-edge-weightings of bipartite graphs
- On Proper Labellings of Graphs with Minimum Label Sum
This page was built for publication: On proper labellings of graphs with minimum label sum
