On the total choosability of planar graphs and of sparse graphs

From MaRDI portal
Revision as of 03:34, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:407575

DOI10.1016/J.IPL.2010.07.007zbMath1234.05081OpenAlexW1978952272MaRDI QIDQ407575

Nicolas Roussel, Gerard Jennhwa Chang, Jian-Feng Hou

Publication date: 27 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/238948/-1/102.pdf




Related Items (8)




Cites Work




This page was built for publication: On the total choosability of planar graphs and of sparse graphs