On the hardness of determining the irregularity strength of graphs

DOI10.1016/J.TCS.2022.09.033MaRDI QIDQ2089679zbMATH OpenOpenAlexFDO

Authors 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 complexitydetectable colouringdistant irregularity strengthgraph labellingirregularity strength

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• 1-distant irregularity strength of graphs
• On graph irregularity strength
• An iterative approach to graph irregularity strength
• A Tight Bound on the Irregularity Strength of Graphs
• scientific article; zbMATH DE number 4142073

Cites work

• A constructive proof of Vizing's theorem
• A dynamic survey of graph labeling
• A general decomposition theory for the 1-2-3 conjecture and locally irregular decompositions
• A Tight Bound on the Irregularity Strength of Graphs
• Algorithmic complexity of proper labeling problems
• Detection number of bipartite graphs and cubic graphs
• Distant irregularity strength of graphs
• Edge weights and vertex colours
• Going wide with the 1-2-3 conjecture
• Hard tiling problems with simple tiles
• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• scientific article; zbMATH DE number 5054146 (Why is no real title available?)
• On the complexity of vertex-coloring edge-weightings

Cited in

(2)

• A Tight Bound on the Irregularity Strength of Graphs
• A notion of vertex equitability for proper labellings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089679)