Bipartite core conjecture for bridgeless cubic graphs
Let be a bridgeless cubic graph, and let a bipartite core mean a core whose underlying graph is bipartite. Bipartite core conjecture. Every bridgeless cubic graph has a bipartite core. The paper proves that this conjecture is equivalent to the cyclic core conjecture and hence to the Fan–Raspaud conjecture.
References
Primary source
Ligang Jin, Giuseppe Mazzuoccolo and Eckhard Steffen, “Cores, joins and the Fano-flow conjectures”, arXiv:1601.05762 (2016).
Additional references
2 papers in this index state this conjecture (2012–2016). The statement above is taken from the most recent of them; the others are arXiv:1209.4510.
Progress summary
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.