A notion of vertex equitability for proper labellings
From MaRDI portal
Publication:6153474
Recommendations
Cites work
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- A Tight Bound on the Irregularity Strength of Graphs
- A new upper bound for the irregularity strength of graphs
- A relaxed case on 1-2-3 conjecture
- Algorithmic complexity of proper labeling problems
- An injective version of the 1-2-3 conjecture
- Distant irregularity strength of graphs
- Edge weights and vertex colours
- Equitable Coloring
- Equitable neighbour-sum-distinguishing edge and total colourings
- Further results on an equitable 1-2-3 conjecture
- Going wide with the 1-2-3 conjecture
- Hard tiling problems with simple tiles
- On the complexity of vertex-coloring edge-weightings
- On the hardness of determining the irregularity strength of graphs
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Vertex-coloring edge-weightings of graphs
- Vertex-coloring edge-weightings: towards 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)