Sun, Jian; Zhang, Zan-Bo; Chen, Yannan; Han, Deren; Du, Donglei; Zhang, Xiaoyan A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis. (English) Zbl 07762783 J. Glob. Optim. 87, No. 2-4, 917-937 (2023). MSC: 90Cxx PDF BibTeX XML Cite \textit{J. Sun} et al., J. Glob. Optim. 87, No. 2--4, 917--937 (2023; Zbl 07762783) Full Text: DOI
Zamfirescu, Carol T. Cubic vertices in planar hypohamiltonian graphs. (English) Zbl 1466.05038 J. Graph Theory 90, No. 2, 189-207 (2019). MSC: 05C07 05C10 05C45 PDF BibTeX XML Cite \textit{C. T. Zamfirescu}, J. Graph Theory 90, No. 2, 189--207 (2019; Zbl 1466.05038) Full Text: DOI
Belitsky, A. V. Leading order analysis of twist-3 space- and time-like cut vertices in QCD. (English) Zbl 1372.81002 Int. J. Mod. Phys. A 32, No. 22, Article ID 1730018, 54 p. (2017). MSC: 81-02 81T17 81V05 PDF BibTeX XML Cite \textit{A. V. Belitsky}, Int. J. Mod. Phys. A 32, No. 22, Article ID 1730018, 54 p. (2017; Zbl 1372.81002) Full Text: DOI arXiv
Labbate, D. On 3-cut reductions of minimally 1-factorable cubic bigraphs. (English) Zbl 0979.05089 Discrete Math. 231, No. 1-3, 303-310 (2001). MSC: 05C70 PDF BibTeX XML Cite \textit{D. Labbate}, Discrete Math. 231, No. 1--3, 303--310 (2001; Zbl 0979.05089) Full Text: DOI
Burlet, Michel; Goldschmidt, Olivier A new and improved algorithm for the 3-cut problem. (English) Zbl 0908.90263 Oper. Res. Lett. 21, No. 5, 225-227 (1997). MSC: 90C35 PDF BibTeX XML Cite \textit{M. Burlet} and \textit{O. Goldschmidt}, Oper. Res. Lett. 21, No. 5, 225--227 (1997; Zbl 0908.90263) Full Text: DOI
He, Xin An improved algorithm for the planar 3-cut problem. (English) Zbl 0712.68075 J. Algorithms 12, No. 1, 23-37 (1991). MSC: 68R10 68Q25 05C85 PDF BibTeX XML Cite \textit{X. He}, J. Algorithms 12, No. 1, 23--37 (1991; Zbl 0712.68075) Full Text: DOI
Kel’mans, A. K. Nonseparating cycles and planarity of graph-cells. (Russian) Zbl 0747.05036 Problems of discrete optimization and methods for their solution, Work Collect., Moskva, 224-232 (1987). Reviewer: K.Engel (Rostock) MSC: 05C10 05C38 05C40 PDF BibTeX XML
Kel’mans, A. K. Nonseparating circuits and the planarity of graph-cells. (English. Russian original) Zbl 0797.05044 Transl., Ser. 2, Am. Math. Soc. 158, 141-147 (1994); translation from Problems of discrete optimization and methods for their solution, Work Collect., Moskva, 224-232 (1987). MSC: 05C10 05C38 05C40 PDF BibTeX XML Cite \textit{A. K. Kel'mans}, in: Quasi-optimal solutions of the problem of integer programming. . 224--232 (1987; Zbl 0797.05044); translation from Problems of discrete optimization and methods for their solution, Work Collect., Moskva, 224--232 (1987)
Hochbaum, Dorit S.; Shmoys, David B. An \(O(| V| ^ 2)\) algorithm for the planar 3-cut problem. (English) Zbl 0572.05040 SIAM J. Algebraic Discrete Methods 6, 707-712 (1985). Reviewer: S.Stahl MSC: 05C40 05C10 68R10 05C35 PDF BibTeX XML Cite \textit{D. S. Hochbaum} and \textit{D. B. Shmoys}, SIAM J. Algebraic Discrete Methods 6, 707--712 (1985; Zbl 0572.05040) Full Text: DOI