Wu, Shufei; Hou, Jianfeng Graph partitioning: an updated survey. (English) Zbl 1519.05209 AKCE Int. J. Graphs Comb. 20, No. 1, 9-19 (2023). MSC: 05C70 05C20 05C35 PDFBibTeX XMLCite \textit{S. Wu} and \textit{J. Hou}, AKCE Int. J. Graphs Comb. 20, No. 1, 9--19 (2023; Zbl 1519.05209) Full Text: DOI
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő Minimal 2-connected graphs satisfying the even cut condition. (English) Zbl 1512.05239 Inf. Process. Lett. 167, Article ID 106080, 7 p. (2021). MSC: 05C40 05C82 05C35 05C70 68R10 PDFBibTeX XMLCite \textit{A. S. Jobson} et al., Inf. Process. Lett. 167, Article ID 106080, 7 p. (2021; Zbl 1512.05239) Full Text: DOI
Lin, Jing; Zeng, Qinghou Maximum bisections of graphs without short even cycles. (English) Zbl 1459.05269 J. Comb. Theory, Ser. A 180, Article ID 105404, 30 p. (2021). MSC: 05C70 05C38 05C12 05C35 PDFBibTeX XMLCite \textit{J. Lin} and \textit{Q. Zeng}, J. Comb. Theory, Ser. A 180, Article ID 105404, 30 p. (2021; Zbl 1459.05269) Full Text: DOI
Pach, János; Tóth, Géza A crossing lemma for multigraphs. (English) Zbl 1446.05026 Discrete Comput. Geom. 63, No. 4, 918-933 (2020). Reviewer: Juan José Montellano Ballesteros (Coyoacán) MSC: 05C10 05C35 05C30 68R10 PDFBibTeX XMLCite \textit{J. Pach} and \textit{G. Tóth}, Discrete Comput. Geom. 63, No. 4, 918--933 (2020; Zbl 1446.05026) Full Text: DOI Link
Braides, Andrea; Cermelli, Paolo; Dovetta, Simone \(\Gamma\)-limit of the cut functional on dense graph sequences. (English) Zbl 1439.05068 ESAIM, Control Optim. Calc. Var. 26, Paper No. 26, 25 p. (2020). MSC: 05C12 05C42 05C63 PDFBibTeX XMLCite \textit{A. Braides} et al., ESAIM, Control Optim. Calc. Var. 26, Paper No. 26, 25 p. (2020; Zbl 1439.05068) Full Text: DOI arXiv Link
Hou, Jianfeng; Yan, Juan Max-bisections of \(H\)-free graphs. (English) Zbl 1429.05163 Discrete Math. 343, No. 1, Article ID 111590, 5 p. (2020). MSC: 05C70 05C12 05C35 05C40 05C38 PDFBibTeX XMLCite \textit{J. Hou} and \textit{J. Yan}, Discrete Math. 343, No. 1, Article ID 111590, 5 p. (2020; Zbl 1429.05163) Full Text: DOI
Erickson, Alejandro; Navaridas, Javier; Stewart, Iain A. Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs. (English) Zbl 1436.68233 J. Comput. Syst. Sci. 108, 10-28 (2020). MSC: 68R10 05C40 68M10 PDFBibTeX XMLCite \textit{A. Erickson} et al., J. Comput. Syst. Sci. 108, 10--28 (2020; Zbl 1436.68233) Full Text: DOI
Herrán, Alberto; Colmenar, J. Manuel; Duarte, Abraham A variable neighborhood search approach for the vertex bisection problem. (English) Zbl 1442.68218 Inf. Sci. 476, 1-18 (2019). MSC: 68T20 05C70 68R10 90C59 PDFBibTeX XMLCite \textit{A. Herrán} et al., Inf. Sci. 476, 1--18 (2019; Zbl 1442.68218) Full Text: DOI
Abreu, Marién; Goedgebeur, Jan; Labbate, Domenico; Mazzuoccolo, Giuseppe Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. (English) Zbl 1443.05055 J. Graph Theory 92, No. 4, 415-444 (2019). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{M. Abreu} et al., J. Graph Theory 92, No. 4, 415--444 (2019; Zbl 1443.05055) Full Text: DOI arXiv
Ji, Yuliang; Ma, Jie; Yan, Juan; Yu, Xingxing On problems about judicious bipartitions of graphs. (English) Zbl 1428.05250 J. Comb. Theory, Ser. B 139, 230-250 (2019). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{Y. Ji} et al., J. Comb. Theory, Ser. B 139, 230--250 (2019; Zbl 1428.05250) Full Text: DOI arXiv
Lokshtanov, Daniel; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav Balanced judicious bipartition is fixed-parameter tractable. (English) Zbl 1425.05129 SIAM J. Discrete Math. 33, No. 4, 1878-1911 (2019). MSC: 05C70 05C35 68Q25 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., SIAM J. Discrete Math. 33, No. 4, 1878--1911 (2019; Zbl 1425.05129) Full Text: DOI arXiv
Atkins, Ross; McDiarmid, Colin Extremal distances for subtree transfer operations in binary trees. (English) Zbl 1414.05074 Ann. Comb. 23, No. 1, 1-26 (2019). MSC: 05C05 05C12 05C35 05C76 92D15 PDFBibTeX XMLCite \textit{R. Atkins} and \textit{C. McDiarmid}, Ann. Comb. 23, No. 1, 1--26 (2019; Zbl 1414.05074) Full Text: DOI arXiv
Lokshtanov, Daniel; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav Balanced judicious bipartition is fixed-parameter tractable. (English) Zbl 1491.05148 Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 40, 15 p. (2018). MSC: 05C70 05C35 68Q27 PDFBibTeX XMLCite \textit{D. Lokshtanov} et al., LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 40, 15 p. (2018; Zbl 1491.05148) Full Text: DOI
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő The minimum size of graphs satisfying cut conditions. (English) Zbl 1380.05047 Discrete Appl. Math. 237, 89-96 (2018). MSC: 05C12 05C35 PDFBibTeX XMLCite \textit{A. S. Jobson} et al., Discrete Appl. Math. 237, 89--96 (2018; Zbl 1380.05047) Full Text: DOI
Ma, Fuda; Hao, Jin-Kao; Wang, Yang An effective iterated tabu search for the maximum bisection problem. (English) Zbl 1391.90610 Comput. Oper. Res. 81, 78-89 (2017). MSC: 90C35 90C59 90C27 90C60 PDFBibTeX XMLCite \textit{F. Ma} et al., Comput. Oper. Res. 81, 78--89 (2017; Zbl 1391.90610) Full Text: DOI
Díaz, Josep; Mertzios, George B. Minimum bisection is NP-hard on unit disk graphs. (English) Zbl 1376.68053 Inf. Comput. 256, 83-92 (2017). MSC: 68Q17 05C10 05C62 PDFBibTeX XMLCite \textit{J. Díaz} and \textit{G. B. Mertzios}, Inf. Comput. 256, 83--92 (2017; Zbl 1376.68053) Full Text: DOI Link
Urschel, John C.; Zikatanov, Ludmil T. On the maximal error of spectral approximation of graph bisection. (English) Zbl 1352.05120 Linear Multilinear Algebra 64, No. 10, 1972-1979 (2016). MSC: 05C50 05C40 68Q17 PDFBibTeX XMLCite \textit{J. C. Urschel} and \textit{L. T. Zikatanov}, Linear Multilinear Algebra 64, No. 10, 1972--1979 (2016; Zbl 1352.05120) Full Text: DOI arXiv
van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej On the parameterized complexity of computing balanced partitions in graphs. (English) Zbl 1329.68150 Theory Comput. Syst. 57, No. 1, 1-35 (2015). MSC: 68Q25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Theory Comput. Syst. 57, No. 1, 1--35 (2015; Zbl 1329.68150) Full Text: DOI arXiv
Wu, Chenchen; Du, Donglei; Xu, Dachuan An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems. (English) Zbl 1327.90183 J. Comb. Optim. 29, No. 1, 53-66 (2015). MSC: 90C22 90C27 PDFBibTeX XMLCite \textit{C. Wu} et al., J. Comb. Optim. 29, No. 1, 53--66 (2015; Zbl 1327.90183) Full Text: DOI
Díaz, Josep; Mertzios, George B. Minimum bisection is NP-hard on unit disk graphs. (English) Zbl 1426.68100 Csuhaj-Varjú, Erzsébet (ed.) et al., Mathematical foundations of computer science 2014. 39th international symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part II. Berlin: Springer. Lect. Notes Comput. Sci. 8635, 251-262 (2014). MSC: 68Q17 05C10 05C62 PDFBibTeX XMLCite \textit{J. Díaz} and \textit{G. B. Mertzios}, Lect. Notes Comput. Sci. 8635, 251--262 (2014; Zbl 1426.68100) Full Text: DOI arXiv Link
Wu, Chenchen; Du, Donglei; Xu, Dachuan An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems. (English) Zbl 1381.90093 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 19th international conference, COCOON 2013, Hangzhou, China, June 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38767-8/pbk). Lecture Notes in Computer Science 7936, 304-315 (2013). MSC: 90C35 68W25 90C22 90C59 PDFBibTeX XMLCite \textit{C. Wu} et al., Lect. Notes Comput. Sci. 7936, 304--315 (2013; Zbl 1381.90093) Full Text: DOI
Armbruster, Michael; Fügenschuh, Marzena; Helmberg, Christoph; Martin, Alexander LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. (English) Zbl 1275.90053 Math. Program. Comput. 4, No. 3, 275-306 (2012). MSC: 90C22 90C57 90C05 90C06 90C10 90C27 PDFBibTeX XMLCite \textit{M. Armbruster} et al., Math. Program. Comput. 4, No. 3, 275--306 (2012; Zbl 1275.90053) Full Text: DOI
Hartke, Stephen G.; Seacrest, Tyler Graphic sequences have realizations containing bisections of large degree. (English) Zbl 1254.05040 J. Graph Theory 71, No. 3-4, 386-401 (2012). MSC: 05C07 05C60 PDFBibTeX XMLCite \textit{S. G. Hartke} and \textit{T. Seacrest}, J. Graph Theory 71, No. 3--4, 386--401 (2012; Zbl 1254.05040) Full Text: DOI
Wang, Rong-Long; Okazaki, Kozo A two-state ant colony algorithm for solving the minimum graph bisection problem. (English) Zbl 1185.68500 Int. J. Comput. Intell. Appl. 8, No. 4, 487-498 (2009). MSC: 68R10 68M99 PDFBibTeX XMLCite \textit{R.-L. Wang} and \textit{K. Okazaki}, Int. J. Comput. Intell. Appl. 8, No. 4, 487--498 (2009; Zbl 1185.68500) Full Text: DOI
Fox, Jacob; Tóth, Csaba D. On the decay of crossing numbers. (English) Zbl 1131.05033 J. Comb. Theory, Ser. B 98, No. 1, 33-42 (2008). Reviewer: László A. Székely (Columbia) MSC: 05C10 05C35 PDFBibTeX XMLCite \textit{J. Fox} and \textit{C. D. Tóth}, J. Comb. Theory, Ser. B 98, No. 1, 33--42 (2008; Zbl 1131.05033) Full Text: DOI
Lü, Kebo; Yang, Jialiang; Wang, Jun Isoperimetric number of a kind of Cartesian product graphs. (Chinese. English summary) Zbl 1113.05051 J. Dalian Univ. Technol. 45, No. 5, 762-765 (2005). Reviewer: Lai Chunhui (Zhangzhou) MSC: 05C35 05C40 PDFBibTeX XMLCite \textit{K. Lü} et al., J. Dalian Univ. Technol. 45, No. 5, 762--765 (2005; Zbl 1113.05051)
Xu, Feng-min; Xu, Cheng-xian; Xue, Hong-gang A feasible direction algorithm without line search for solving max-bisection problems. (English) Zbl 1086.65062 J. Comput. Math. 23, No. 6, 619-634 (2005). Reviewer: Vincentiu Dumitru (Bucureşti) MSC: 65K05 90C35 90C27 68R05 68R10 05C35 05C85 PDFBibTeX XMLCite \textit{F.-m. Xu} et al., J. Comput. Math. 23, No. 6, 619--634 (2005; Zbl 1086.65062)
Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs. (English) Zbl 1087.90063 SIAM J. Comput. 35, No. 1, 110-119 (2005). MSC: 90C27 68W25 68W40 68Q17 68Q25 68R10 05C62 PDFBibTeX XMLCite \textit{K. Jansen} et al., SIAM J. Comput. 35, No. 1, 110--119 (2005; Zbl 1087.90063) Full Text: DOI
Kaveh, A.; Rahami, H. An efficient method for decomposition of regular structures using graph products. (English) Zbl 1075.74539 Int. J. Numer. Methods Eng. 61, No. 11, 1797-1808 (2004). MSC: 74H15 74H45 74S30 05C90 PDFBibTeX XMLCite \textit{A. Kaveh} and \textit{H. Rahami}, Int. J. Numer. Methods Eng. 61, No. 11, 1797--1808 (2004; Zbl 1075.74539) Full Text: DOI
Bezrukov, S.; Elsässer, R.; Monien, B.; Preis, R.; Tillich, J.-P. New spectral lower bounds on the bisection width of graphs. (English) Zbl 1067.05046 Theor. Comput. Sci. 320, No. 2-3, 155-174 (2004). MSC: 05C50 05C35 68R10 PDFBibTeX XMLCite \textit{S. Bezrukov} et al., Theor. Comput. Sci. 320, No. 2--3, 155--174 (2004; Zbl 1067.05046) Full Text: DOI
Azizoğlu, M. Cemil; Eğecioğlu, Ömer The bisection width and the isoperimetric number of arrays. (English) Zbl 1050.05069 Discrete Appl. Math. 138, No. 1-2, 3-12 (2004). Reviewer: Alexander Rappoport (Moskva) MSC: 05C35 PDFBibTeX XMLCite \textit{M. C. Azizoğlu} and \textit{Ö. Eğecioğlu}, Discrete Appl. Math. 138, No. 1--2, 3--12 (2004; Zbl 1050.05069) Full Text: DOI
Feige, Uriel; Yahalom, Orly On the complexity of finding balanced oneway cuts. (English) Zbl 1175.68188 Inf. Process. Lett. 87, No. 1, 1-5 (2003). MSC: 68Q17 68R10 PDFBibTeX XMLCite \textit{U. Feige} and \textit{O. Yahalom}, Inf. Process. Lett. 87, No. 1, 1--5 (2003; Zbl 1175.68188) Full Text: DOI
Azizoğlu, M. Cemil; Eğecioğlu, Ömer Extremal sets minimizing dimension-normalized boundary in Hamming graphs. (English) Zbl 1041.05041 SIAM J. Discrete Math. 17, No. 2, 219-236 (2003). MSC: 05C35 05C40 05D05 PDFBibTeX XMLCite \textit{M. C. Azizoğlu} and \textit{Ö. Eğecioğlu}, SIAM J. Discrete Math. 17, No. 2, 219--236 (2003; Zbl 1041.05041) Full Text: DOI
Kaveh, A.; Davaran, A. A hybrid method for domain decomposition in parallel computing. (English) Zbl 0964.65141 Iran. J. Sci. Technol. 24, No. 3, Trans. B, Technol., 321-332, 368 (2000). Reviewer: Iulian Coroian (Baia Mare) MSC: 65N55 65N25 65F10 65N30 35J05 PDFBibTeX XMLCite \textit{A. Kaveh} and \textit{A. Davaran}, Iran. J. Sci. Technol. 24, No. 3, 321--332, 368 (2000; Zbl 0964.65141)
Azizoğlu, M. Cemil; Eğecioğlu, Ömer The isoperimetric number of \(d\)-dimensional \(k\)-ary arrays. (English) Zbl 1320.05063 Int. J. Found. Comput. Sci. 10, No. 3, 289-300 (1999). MSC: 05C35 05C76 68R10 PDFBibTeX XMLCite \textit{M. C. Azizoğlu} and \textit{Ö. Eğecioğlu}, Int. J. Found. Comput. Sci. 10, No. 3, 289--300 (1999; Zbl 1320.05063) Full Text: DOI
Benson, Steven J.; Ye, Yinyu; Zhang, Xiong Mixed linear and semidefinite programming for combinatorial and quadratic optimization. (English) Zbl 0973.90055 Optim. Methods Softw. 11-12, No. 1-4, 515-544 (1999). MSC: 90C22 90C27 90C20 65K05 90-04 PDFBibTeX XMLCite \textit{S. J. Benson} et al., Optim. Methods Softw. 11--12, No. 1--4, 515--544 (1999; Zbl 0973.90055) Full Text: DOI
Kaveh, A.; Davaran, A. Spectral bisection of adaptive finite element meshes for parallel processing. (English) Zbl 0969.74594 Comput. Struct. 70, No. 3, 315-323 (1999). MSC: 74S05 74S25 74K10 PDFBibTeX XMLCite \textit{A. Kaveh} and \textit{A. Davaran}, Comput. Struct. 70, No. 3, 315--323 (1999; Zbl 0969.74594) Full Text: DOI
Azizoğlu, M. Cemil; Eğecioğlu, Ömer Isoperimetric number of the Cartesian product of graphs and paths. (English) Zbl 0951.05054 Congr. Numerantium 131, 135-143 (1998). MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{M. C. Azizoğlu} and \textit{Ö. Eğecioğlu}, Congr. Numerantium 131, 135--143 (1998; Zbl 0951.05054)
Coriand, Andrea Methods of mesh partitioning. (Verfahren zur Partitionierung von Gittern.) (German) Zbl 0912.76071 DLR Forschungsbericht. 20. Köln: DLR, Deutsches Zentrum für Luft- und Raumfahrt, 47 S. (1998). MSC: 76M99 65M50 65N50 65Y05 76-02 PDFBibTeX XMLCite \textit{A. Coriand}, Verfahren zur Partitionierung von Gittern. Köln: DLR, Deutsches Zentrum für Luft- und Raumfahrt (1998; Zbl 0912.76071)
Chung, F. R. K.; Tetali, Prasad Isoperimetric inequalities for Cartesian products of graphs. (English) Zbl 0911.05038 Comb. Probab. Comput. 7, No. 2, 141-148 (1998). Reviewer: P.Braß (Berlin) MSC: 05C35 05C40 PDFBibTeX XMLCite \textit{F. R. K. Chung} and \textit{P. Tetali}, Comb. Probab. Comput. 7, No. 2, 141--148 (1998; Zbl 0911.05038) Full Text: DOI
Kruyt, N. P. A conjugate gradient method for the spectral partitioning of graphs. (English) Zbl 0906.68104 Parallel Comput. 22, No. 11, 1493-1502 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{N. P. Kruyt}, Parallel Comput. 22, No. 11, 1493--1502 (1997; Zbl 0906.68104) Full Text: DOI
Kaiho, M.; Ikegawa, M.; Kato, C. Parallel overlapping scheme for viscous incompressible flows. (English) Zbl 0883.76049 Int. J. Numer. Methods Fluids 24, No. 12, 1341-1352 (1997). MSC: 76M10 76M20 76D05 PDFBibTeX XMLCite \textit{M. Kaiho} et al., Int. J. Numer. Methods Fluids 24, No. 12, 1341--1352 (1997; Zbl 0883.76049) Full Text: DOI
Helmberg, Christoph; Rendl, Franz; Vanderbei, Robert J.; Wolkowicz, Henry An interior-point method for semidefinite programming. (English) Zbl 0853.65066 SIAM J. Optim. 6, No. 2, 342-361 (1996). Reviewer: K.Schittkowski (Bayreuth) MSC: 65K05 90C30 PDFBibTeX XMLCite \textit{C. Helmberg} et al., SIAM J. Optim. 6, No. 2, 342--361 (1996; Zbl 0853.65066) Full Text: DOI
Andreae, Th.; Bandelt, H.-J. Minimum transversals of maximum matchings as approximate solutions to the bisection problem. (English) Zbl 0858.05086 Abh. Math. Semin. Univ. Hamb. 65, 199-203 (1995). Reviewer: E.Ederle (München) MSC: 05C70 05C35 90C35 PDFBibTeX XMLCite \textit{Th. Andreae} and \textit{H. J. Bandelt}, Abh. Math. Semin. Univ. Hamb. 65, 199--203 (1995; Zbl 0858.05086) Full Text: DOI
Vanderstraeten, D.; Keunings, R.; Farhat, C. Beyond conventional mesh partitioning algorithms and the mimimum edge cut criterion: Impact on realistic applications. (English) Zbl 0836.65121 Bailey, David H. (ed.) et al., Proceedings of the seventh SIAM conference on parallel processing for scientific computing, San Francisco, CA (USA), February 15-17, 1995. Philadelphia, PA: SIAM. 611-614 (1995). MSC: 65N50 65Y05 PDFBibTeX XMLCite \textit{D. Vanderstraeten} et al., in: Proceedings of the seventh SIAM conference on parallel processing for scientific computing, San Francisco, CA (USA), February 15-17, 1995. Philadelphia, PA: SIAM. 611--614 (1995; Zbl 0836.65121)
Boese, Kenneth D.; Kahng, Andrew B. Best-so-far vs. where-you-are: Implications for optimal finite-time annealing. (English) Zbl 0791.90048 Syst. Control Lett. 22, No. 1, 71-78 (1994). MSC: 90C27 90-08 PDFBibTeX XMLCite \textit{K. D. Boese} and \textit{A. B. Kahng}, Syst. Control Lett. 22, No. 1, 71--78 (1994; Zbl 0791.90048) Full Text: DOI
Mohar, Bojan; Poljak, Svatopluk Eigenvalues in combinatorial optimization. (English) Zbl 0806.90104 Brualdi, Richard A. (ed.) et al., Combinatorial and graph-theoretical problems in linear algebra. Proceedings of a workshop that was an integral part of the 1991-92 IMA program on “Applied Linear Algebra” held at the University of Minnesota, USA, November 11-15, 1991. New York: Springer-Verlag. IMA Vol. Math. Appl. 50, 107-151 (1993). Reviewer: G.Schulz (Magdeburg) MSC: 90C27 05C50 15A18 90C35 PDFBibTeX XMLCite \textit{B. Mohar} and \textit{S. Poljak}, IMA Vol. Math. Appl. 50, 107--151 (1993; Zbl 0806.90104)
Saab, Youssef; Rao, Vasant On the graph bisection problem. (English) Zbl 0768.05056 IEEE Trans. Circuits Syst., I, Fundam. Theory Appl. 39, No. 9, 760-762 (1992). MSC: 05C35 PDFBibTeX XMLCite \textit{Y. Saab} and \textit{V. Rao}, IEEE Trans. Circuits Syst., I, Fundam. Theory Appl. 39, No. 9, 760--762 (1992; Zbl 0768.05056) Full Text: DOI
Kostochka, A. V.; Mel’nikov, L. S. On bounds of the bisection width of cubic graphs. (English) Zbl 0773.05069 Combinatorics, graphs and complexity, Proc. 4th Czech. Symp., Prachatice/Czech. 1990, Ann. Discrete Math. 51, 151-154 (1992). Reviewer: P.Horák (Bratislava) MSC: 05C35 PDFBibTeX XMLCite \textit{A. V. Kostochka} and \textit{L. S. Mel'nikov}, Ann. Discrete Math. 51, 151--154 (1992; Zbl 0773.05069)
Clark, L. H.; Entringer, R. C. The bisection width of cubic graphs. (English) Zbl 0681.05040 Bull. Aust. Math. Soc. 39, No. 3, 389-396 (1989). Reviewer: O.Frank MSC: 05C35 05C80 68R10 68W99 PDFBibTeX XMLCite \textit{L. H. Clark} and \textit{R. C. Entringer}, Bull. Aust. Math. Soc. 39, No. 3, 389--396 (1989; Zbl 0681.05040) Full Text: DOI