A solution to the 1-2-3 conjecture
Author:
- Ralph KeuschRKRalph Keusch
- 26 January 2024
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 166, 183-202
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- The 3-flow conjecture, factors modulo k, and the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2016
- Every graph is (2,3)-choosableCombinatorica, 2014
- Total weight choosability of graphsJournal of Graph Theory, 2010
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- On vertex-coloring 13-edge-weightingFrontiers of Mathematics in China, 2008
- Weight choosability of graphsJournal of Graph Theory, 2008
- Degree constrained subgraphsDiscrete Applied Mathematics, 2008
- Vertex colouring edge partitionsJournal of Combinatorial Theory, Series B, 2005
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999