On proper labellings of graphs with minimum label sum
type: Item
instance of: scholarly article
title: On proper labellings of graphs with minimum label sum
author: Julien Bensmail
author: Foivos Fioravantes
author: Nicolas Nisse
published in: Algorithmica
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7495633
zbMATH Keywords: proper labelling
zbMATH Keywords: 1-2-3 conjecture
zbMATH Keywords: minimum label sum
MaRDI profile type: MaRDI publication profile
full work available at URL: s00453-021-00903-x
OpenAlex ID: W3002080513
cites work: Edge weights and vertex colours: minimizing sum count
cites work: On decomposing regular graphs into locally irregular subgraphs
cites work: Equitable neighbour-sum-distinguishing edge and total colourings
cites work: On Proper Labellings of Graphs with Minimum Label Sum
cites work: On minimizing the maximum color for the 1-2-3 conjecture
cites work: On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Vertex-coloring edge-weightings of graphs
cites work: How to Define an Irregular Graph
cites work: Q3824455
cites work: Q5403005
cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
cites work: Edge weights and vertex colours
cites work: Vertex-coloring 2-edge-weighting of graphs
cites work: On neighbour sum-distinguishing $\{0,1\}$-edge-weightings of bipartite graphs
cites work: Minimum-weight triangulation is NP-hard
cites work: The 1-2-3 conjecture almost holds for regular graphs
cites work: The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
DOI: 10.1007/S00453-021-00903-X
description: scientific article; zbMATH DE number 7495633