Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Dirac’s map-color theorem for choosability;Böhme;J. Graph Theory,1999
2. Graph Theory;Bondy,2008
3. Choosability of toroidal graphs without short cycles;Cai;J. Graph Theory,2010
4. Planar graphs without 4-cycles adjacent to triangles are 4-choosable;Cheng;Discrete Math.,2016
5. Toroidal graphs containing neither K5− nor 6-cycles are 4-choosable;Choi;J. Graph Theory,2016