Došlić–Vukićević explicit conjecture for bipartizing fullerenes
Došlić–Vukićević explicit conjecture for bipartizing fullerenes
Let be a fullerene graph with vertices, and let be the minimum number of edges whose removal makes bipartite. Došlić–Vukićević explicit conjecture.
This is presented as a stronger form of the asymptotic conjecture that ; no resolution is given in the supplied text.
Sources & referencesView supporting material
Primary source
Zdenek Dvorak, Bernard Lidicky and Riste Skrekovski, “Bipartizing fullerenes”, arXiv:1106.0420 (2011).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.