A notion of vertex equitability for proper labellings
From MaRDI portal
Publication:6153474
DOI10.1016/J.DAM.2023.12.014OpenAlexW4390246532MaRDI QIDQ6153474FDOQ6153474
Authors: 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
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Edge weights and vertex colours
- Title not available (Why is that?)
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- A Tight Bound on the Irregularity Strength of Graphs
- A new upper bound for the irregularity strength of graphs
- Hard tiling problems with simple tiles
- Equitable Coloring
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Algorithmic complexity of proper labeling problems
- On the complexity of vertex-coloring edge-weightings
- Vertex-coloring edge-weightings of graphs
- Distant irregularity strength of graphs
- A relaxed case on 1-2-3 conjecture
- Equitable neighbour-sum-distinguishing edge and total colourings
- 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
- An injective version of the 1-2-3 conjecture
This page was built for publication: A notion of vertex equitability for proper labellings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153474)
