Total weight choosability of graphs with bounded maximum average degree
Authors:
- Yunfang TangYTYunfang Tang
- Xuding ZhuXZXuding Zhu
- 1 August 2017
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 340 (8) , 2033-2042
Abstract
No abstract availableKeywords
Funding Information
- NSFC (11571319)
This publication has 17 references indexed in Scilit:
- Total Weight Choosability of TreesSIAM Journal on Discrete Mathematics, 2017
- The 1,2,3-Conjecture and 1,2-Conjecture for sparse graphsDiscussiones Mathematicae Graph Theory, 2014
- On total weight choosability of graphsJournal of Combinatorial Optimization, 2012
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- Weight choosability of graphsJournal of Graph Theory, 2008
- 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