Quasi-majority neighbor sum distinguishing edge-colorings
Authors:
- Rafał KalinowskiRKRafał Kalinowski
- Monika PilśniakMPMonika Pilśniak
- Elżbieta SidorowiczESElżbieta Sidorowicz
- Elżbieta TurowskaETElżbieta Turowska
- 20 April 2026
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (10)
Abstract
No abstract availableAll Related Versions
Funding Information
- Ministerstwo Edukacji i Nauki
This publication has 11 references indexed in Scilit:
- A solution to the 1-2-3 conjectureJournal of Combinatorial Theory, Series B, 2024
- Neighbour sum distinguishing edge-weightings with local constraintsDiscrete Applied Mathematics, 2023
- A note on asymptotically optimal neighbour sum distinguishing colouringsEuropean Journal of Combinatorics, 2019
- Neighbor-sum-distinguishing edge choosability of subcubic graphsJournal of Combinatorial Optimization, 2016
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz RevisitedJournal of Graph Theory, 2014
- An improved upper bound for the neighbor sum distinguishing index of graphsDiscrete Applied Mathematics, 2014
- Neighbor Sum Distinguishing IndexGraphs and Combinatorics, 2012
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999