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