Total weight choosability of Mycielski graphs
- 14 August 2015
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 33 (1) , 165-182
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (CN) (11171310)
This publication has 13 references indexed in Scilit:
- Total weight choosability of Cartesian product of graphsEuropean Journal of Combinatorics, 2012
- 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
- 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-WeightingsCombinatorica, 2007
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999
- Colorings and orientations of graphsCombinatorica, 1992