Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Planar graphs without 4-cycles adjacent to triangles are 4-choosable;Chen;Discrete Math.,2016
2. Choosability in graphs;Erdős;Congr. Numer.,1979
3. Planar graphs without 7-cycles a re 4-choosable;Farzad;Discrete Math.,2009
4. Planar graphs without cycles of specific lengths;Fijavz;Eur. J. Comb.,2002
5. The 4-choosability of plane graphs without 4-cycles;Lam;J. Comb. Theory, Ser. B,1999