[{"publication":"European J. Combinatorics","citation":{"bibtex":"@article{Jin_Kang_Steffen_2016, title={Choosability in signed planar graphs}, volume={52}, journal={European J. Combinatorics}, author={Jin, Ligang and Kang, Yingli and Steffen, Eckhard}, year={2016}, pages={234–243} }","chicago":"Jin, Ligang, Yingli Kang, and Eckhard Steffen. “Choosability in Signed Planar Graphs.” <i>European J. Combinatorics</i> 52 (2016): 234–43.","ama":"Jin L, Kang Y, Steffen E. Choosability in signed planar graphs. <i>European J Combinatorics</i>. 2016;52:234-243.","short":"L. Jin, Y. Kang, E. Steffen, European J. Combinatorics 52 (2016) 234–243.","ieee":"L. Jin, Y. Kang, and E. Steffen, “Choosability in signed planar graphs,” <i>European J. Combinatorics</i>, vol. 52, pp. 234–243, 2016.","mla":"Jin, Ligang, et al. “Choosability in Signed Planar Graphs.” <i>European J. Combinatorics</i>, vol. 52, 2016, pp. 234–43.","apa":"Jin, L., Kang, Y., &#38; Steffen, E. (2016). Choosability in signed planar graphs. <i>European J. Combinatorics</i>, <i>52</i>, 234–243."},"date_created":"2019-06-07T10:07:21Z","type":"journal_article","title":"Choosability in signed planar graphs","status":"public","year":"2016","author":[{"full_name":"Jin, Ligang","first_name":"Ligang","last_name":"Jin"},{"last_name":"Kang","first_name":"Yingli","full_name":"Kang, Yingli"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        52","page":"234-243","language":[{"iso":"eng"}],"_id":"10161","user_id":"15540","volume":52}]