A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
NODE-DISJOINT CYCLES IN BRIDGELESS CUBIC GRAPH
[post]
2018
unpublished
Preserved Fulltext
We prove the $\mathrm{NP}$-hardness of deciding whether a connected bridgeless cubic graph $G(V, E)$ contains two node-disjoint cycles of equal cardinality $|V |/2$.
doi:10.31219/osf.io/9w2vc
fatcat:gyqukxmpfvdare5jejkusg54ym