Diaby, Moustapha; Karwan, Mark H. Advances in combinatorial optimization. Linear programming formulations of the traveling salesman and other hard combinatorial optimization problems. (English) Zbl 1371.90002 Hackensack, NJ: World Scientific (ISBN 978-981-4704-87-8/hbk; 978-981-4704-89-2/ebook). xiii, 203 p. (2016). Reviewer: Patric R. J. Östergård (Aalto) MSC: 90-02 90C05 90C27 68Q15 PDFBibTeX XMLCite \textit{M. Diaby} and \textit{M. H. Karwan}, Advances in combinatorial optimization. Linear programming formulations of the traveling salesman and other hard combinatorial optimization problems. Hackensack, NJ: World Scientific (2016; Zbl 1371.90002) Full Text: DOI
Kawarabayashi, Ken-ichi; Thorup, Mikkel Coloring 3-colorable graphs with \(o(n^{1/5})\) colors. (English) Zbl 1359.05123 Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 458-469 (2014). MSC: 05C85 05C15 68W25 PDFBibTeX XMLCite \textit{K.-i. Kawarabayashi} and \textit{M. Thorup}, LIPIcs -- Leibniz Int. Proc. Inform. 25, 458--469 (2014; Zbl 1359.05123) Full Text: DOI
Lu, Xiaoxu; Xu, Baogang A note on vertex-arboricity of plane graphs. (English) Zbl 1150.05319 J. Nanjing Univ., Nat. Sci. 43, No. 1, 13-18 (2007). MSC: 05C07 05C15 PDFBibTeX XMLCite \textit{X. Lu} and \textit{B. Xu}, J. Nanjing Univ., Nat. Sci. 43, No. 1, 13--18 (2007; Zbl 1150.05319)
Jäger, Gerold An efficient algorithm for graph bisection of triangularizations. (English) Zbl 1125.05100 Appl. Math. Sci., Ruse 1, No. 25-28, 1203-1215 (2007). Reviewer: Haiko Müller (Leeds) MSC: 05C85 90C35 PDFBibTeX XMLCite \textit{G. Jäger}, Appl. Math. Sci., Ruse 1, No. 25--28, 1203--1215 (2007; Zbl 1125.05100)
Mohar, Bojan Face covers and the genus problem for apex graphs. (English) Zbl 1025.05019 J. Comb. Theory, Ser. B 82, No. 1, 102-117 (2001). Reviewer: Bojan Mohar (Ljublana) MSC: 05C10 05C85 68R10 PDFBibTeX XMLCite \textit{B. Mohar}, J. Comb. Theory, Ser. B 82, No. 1, 102--117 (2001; Zbl 1025.05019) Full Text: DOI
Yuan, Jinjiang; Huang, Qiongxiang Some lower bounds of bandwidth sum of graphs with applications. (English) Zbl 0936.05078 Math. Appl. 9, No. 4, 536-538 (1996). MSC: 05C78 05C35 PDFBibTeX XMLCite \textit{J. Yuan} and \textit{Q. Huang}, Math. Appl. 9, No. 4, 536--538 (1996; Zbl 0936.05078)
Plaisted, David A. A heuristic algorithm for small separators in arbitrary graphs. (English) Zbl 0697.68046 SIAM J. Comput. 19, No. 2, 267-280 (1990). Reviewer: M.Vlach MSC: 68Q25 68W99 05C99 PDFBibTeX XMLCite \textit{D. A. Plaisted}, SIAM J. Comput. 19, No. 2, 267--280 (1990; Zbl 0697.68046) Full Text: DOI
Mitchison, Graeme; Durbin, Richard Optimal numberings of an N\(\times N\) array. (English) Zbl 0617.05059 SIAM J. Algebraic Discrete Methods 7, 571-582 (1986). MSC: 05C99 05B99 PDFBibTeX XMLCite \textit{G. Mitchison} and \textit{R. Durbin}, SIAM J. Algebraic Discrete Methods 7, 571--582 (1986; Zbl 0617.05059) Full Text: DOI
Shiloach, Yossi A minimum linear arrangement algorithm for undirected trees. (English) Zbl 0399.05021 SIAM J. Comput. 8, 15-32 (1979). MSC: 05C05 05-04 PDFBibTeX XMLCite \textit{Y. Shiloach}, SIAM J. Comput. 8, 15--32 (1979; Zbl 0399.05021) Full Text: DOI