Abstract
A total weighting of a graph G is a mapping \(\phi \) that assigns a weight to each vertex and each edge of G. The vertex-sum of \(v \in V(G)\) with respect to \(\phi \) is \(S_{\phi }(v)=\sum _{e\in E(v)}\phi (e)+\phi (v)\). A total weighting is proper if adjacent vertices have distinct vertex-sums. A graph \(G=(V,E)\) is called \((k,k')\)-choosable if the following is true: If each vertex x is assigned a set L(x) of k real numbers, and each edge e is assigned a set L(e) of \(k'\) real numbers, then there is a proper total weighting \(\phi \) with \(\phi (y)\in L(y)\) for any \(y \in V \cup E\). In this paper, we prove that for any graph \(G\ne K_1\), the Mycielski graph of G is (1,4)-choosable. Moreover, we give some sufficient conditions for the Mycielski graph of G to be (1,3)-choosable. In particular, our result implies that if G is a complete bipartite graph, a complete graph, a tree, a subcubic graph, a fan, a wheel, a Halin graph, or a grid, then the Mycielski graph of G is (1,3)-choosable.
Similar content being viewed by others
References
Addario-Berry L, Dalal K, McDiarmid C, Reed BA, Thomason A (2007) Vertex-colouring edge-weightings. Combinatorica 27:1–12
Addario-Berry L, Dalal K, Reed BA (2008) Degree constrained subgraphs. Discrete Appl Math 156(7):1168–1174
Alon N (1999) Combinatorial Nullstellensatz. Combin Probab Comput 8:7–29
Alon N, Tarsi M (1992) Colorings and orientations of graphs. Combinatorica 12:125–134
Bartnicki T, Grytczuk J, Niwczyk S (2009) Weight choosability of graphs. J Graph Theory 60:242–256
Kalkowski M (2009) A note on the 1,2-conjecture. Personal communication via Grytczuk
Kalkowski M, Karoński M, Pfender F (2010) Vertex-coloring edge-weightings: towards the 1-2-3 conjecture. J Combin Theory Ser B 100(3):347–349
Karoński M, Łuczak T, Thomason A (2004) Edge weights and vertex colours. J Combin Theory Ser B 91:151–157
Przybyło J, Woźniak M (2011) Total weight choosability of graphs. Electron J Combin 18:1
Wang T, Yu QL (2008) On vertex-coloring 13-edge-weighting. Front Math China 3:581–587
Wong T, Wu J, Zhu X (2012) Total weight choosability of Cartesian product of graphs. Eur J Combin 33:1725–1738
Wong T, Yang D, Zhu X (2010) List total weighting of graphs. Fete of combinatorics and computer science, vol 20. Bolyai Society Mathematical Studies, Budapest, pp 337–353
Wong T, Zhu X (2011) Total weight choosability of graphs. J Graph Theory 66:198–212
Wong T, Zhu X (2014) Permanent index of matrices associated with graphs. Manuscript
Wong T, Zhu X (2014) Every graph is (2,3)-choosable. Combinatorica. doi:10.1007/s00493-014-3057-8
Acknowledgments
We thank Professor Tsai-Lien Wong and an anonymous referee for reading the manuscript carefully and for many valuable comments. This research supported by NSFC Grant 11171310
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tang, Y., Zhu, X. Total weight choosability of Mycielski graphs. J Comb Optim 33, 165–182 (2017). https://doi.org/10.1007/s10878-015-9943-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-015-9943-1