The 1–2–3 Conjecture almost holds for regular graphs
Author:
- Jakub PrzybyłoJPJakub Przybyło
- 1 March 2021
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 147, 183-200
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphsDiscrete Applied Mathematics, 2019
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- Weight choosability of graphsJournal of Graph Theory, 2008
- Irregularity strength of dense graphsJournal of Graph Theory, 2008
- Degree constrained subgraphsDiscrete Applied Mathematics, 2008
- Vertex-Colouring Edge-WeightingsCombinatorica, 2007
- Vertex colouring edge partitionsJournal of Combinatorial Theory, Series B, 2005
- On graph irregularity strengthJournal of Graph Theory, 2002
- Irregular Assignments of Trees and ForestsSIAM Journal on Discrete Mathematics, 1990
- How to Define an Irregular GraphThe College Mathematics Journal, 1988