Now showing items 1-1 of 1

  • Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles 

    Ferreri, Susanna (Brock University, 2013-09-05)
    The conjecture claiming that every planar graph is acyclic 5-choosable[Borodin et al., 2002] has been verified for several restricted classes of planargraphs. Recently, O. V. Borodin and A. O. Ivanova, [Journal of Graph ...