On the hardness of determining the irregularity strength of graphs

DOI10.1016/j.tcs.2022.09.033OpenAlexW4301369355MaRDI QIDQ2089679

Julien Bensmail

Publication date: 24 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.033

zbMATH Keywords

algorithmic complexitygraph labellingirregularity strengthdistant irregularity strengthdetectable colouring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

A notion of vertex equitability for proper labellings

Cites Work

• Algorithmic complexity of proper labeling problems
• Distant irregularity strength of graphs
• A constructive proof of Vizing's theorem
• A dynamic survey of graph labeling
• Edge weights and vertex colours
• Going wide with the 1-2-3 conjecture
• A Tight Bound on the Irregularity Strength of Graphs
• Hard tiling problems with simple tiles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the hardness of determining the irregularity strength of graphs