Every graph is (2,3)-choosable
- 22 October 2014
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 36 (1) , 121-127
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Total Weight Choosability of GraphsThe Electronic Journal of Combinatorics, 2011
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- Weight choosability of graphsJournal of Graph Theory, 2008
- Marcinkiewicz integral with rough kernelsFrontiers of Mathematics in China, 2007
- Vertex-Colouring Edge-WeightingsCombinatorica, 2007
- 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
- Colorings and orientations of graphsCombinatorica, 1992
- A nowhere-zero point in linear mappingsCombinatorica, 1989