Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
3-choosability of planar graphs with (≤ 4)-cycles far apart Zdeněk Dvořák∗ Abstract A graph is k-choosable if it can be colored whenever every vertex
Add to Reading List
Document Date: 2016-02-04 05:53:38
Open Document
File Size: 429,11 KB
Share Result on Facebook