Colorability conjecture for cyclic pseudo-Loupekine graphs with parity conditions
Colorability conjecture for cyclic pseudo-Loupekine graphs with parity conditions
Let be a Loupekine 5-pole, let , and let denote the associated cyclic pseudo-Loupekine graph. Assume that is even and is odd. Cyclic pseudo-Loupekine colorability conjecture. All such graphs are 3-edge-colorable. This conjecture concerns a broad generalization of Loupekine's construction; the supplied text gives no resolution or partial proof.
Sources & referencesView supporting material
Primary source
Leah Wrenn Berman, Déborah Oliveros and Gordon I. Williams, “Cyclic pseudo-Loupekine snarks”, arXiv:1707.05294 (2019).
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.