Behsaz–Hatami–Mahmoodian's minimum vertex-cover conjecture for generalized Petersen graphs
Let be the generalized Petersen graph, and let denote the size of a minimum vertex cover. Behsaz–Hatami–Mahmoodian's conjecture. For all and ,
References
Status
- Solved: Dannielle D. D. Jin and David G. L. Wang. On the minimum vertex cover of generalized Petersen graphs (Discrete Applied Mathematics, 2019) https://doi.org/10.1016/j.dam.2018.12.011
Source: Nazli Besharati, J. Ebrahimi B and A. Azadi, “Independence number of generalized Petersen graphs”, arXiv:1008.2583 (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
No solutions have been posted yet.