On the hardness of determining the irregularity strength of graphs

DOI10.1016/J.TCS.2022.09.033OpenAlexW4301369355MaRDI QIDQ2089679FDOQ2089679

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

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
• Publication:3474670

zbMATH Keywords

irregularity strengthalgorithmic complexitydistant irregularity strengthgraph labellingdetectable colouring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (2)

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

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)