On the hardness of determining the irregularity strength of graphs
type: Item
instance of: scholarly article
title: On the hardness of determining the irregularity strength of graphs
author: Julien Bensmail
published in: Theoretical Computer Science
publication date: 2022-10-24T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7605948
zbMATH Keywords: irregularity strength
zbMATH Keywords: distant irregularity strength
zbMATH Keywords: detectable colouring
zbMATH Keywords: graph labelling
zbMATH Keywords: algorithmic complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2022.09.033
OpenAlex ID: W4301369355
cites work: Algorithmic complexity of proper labeling problems
cites work: Q5377221
cites work: Going wide with the 1-2-3 conjecture
cites work: Q5488328
cites work: Q3824455
cites work: Q5403005
cites work: A dynamic survey of graph labeling
cites work: Q5173164
cites work: Edge weights and vertex colours
cites work: A constructive proof of Vizing's theorem
cites work: Hard tiling problems with simple tiles
cites work: A Tight Bound on the Irregularity Strength of Graphs
cites work: Distant irregularity strength of graphs
DOI: 10.1016/J.TCS.2022.09.033
description: scientific article; zbMATH DE number 7605948