A notion of vertex equitability for proper labellings

DOI10.1016/j.dam.2023.12.014OpenAlexW4390246532MaRDI QIDQ6153474

Julien Bensmail

Publication date: 14 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.12.014

zbMATH Keywords

irregularity strength1-2-3 conjectureequitabilityirregular labellingproper labelling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• Algorithmic complexity of proper labeling problems
• Distant irregularity strength of graphs
• Vertex-coloring edge-weightings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Equitable neighbour-sum-distinguishing edge and total colourings
• Edge weights and vertex colours
• Further results on an equitable 1-2-3 conjecture
• On the hardness of determining the irregularity strength of graphs
• Going wide with the 1-2-3 conjecture
• A relaxed case on 1-2-3 conjecture
• An injective version of the 1-2-3 conjecture
• A New Upper Bound for the Irregularity Strength of Graphs
• Equitable Coloring
• A Tight Bound on the Irregularity Strength of Graphs
• Hard tiling problems with simple tiles

This page was built for publication: A notion of vertex equitability for proper labellings