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

First Page		Document Content
Date: 2016-02-04 05:53:38		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 Source URL: iti.mff.cuni.cz Download Document from Source Website File Size: 429,11 KB Share Document on Facebook