Abstract

On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles [Information Processing Letters 110 (24) (2010) 1084

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call