The conjecture that every graph is(2,2)-choosability has so far not been solved.To push(2,2)-choosability proof,the method of permanent index was used to show that all tricyclic graphs are(2,2)-choosability.
list assignmenttotal weight choosabilitypermanent indextricyclic graph
万方数据
