Biedl, Therese; Derka, Martin Order-preserving 1-string representations of planar graphs. (English) Zbl 1450.05058 Steffen, Bernhard (ed.) et al., SOFSEM 2017: theory and practice of computer science. 43rd international conference on current trends in theory and practice of computer science, Limerick, Ireland, January 16–20, 2017, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10139, 283-294 (2017). MSC: 05C62 05C10 PDFBibTeX XMLCite \textit{T. Biedl} and \textit{M. Derka}, Lect. Notes Comput. Sci. 10139, 283--294 (2017; Zbl 1450.05058) Full Text: DOI arXiv
Khuller, Samir Parallel algorithms for the subgraph homeomorphism problem. (English) Zbl 0765.68039 Algorithms and data structures, Proc. workshop WADS ’89, Ottawa/Canada 1989, Lect. Notes Comput. Sci. 382, 303-315 (1989). MSC: 68W15 68R10 05C85 PDFBibTeX XMLCite \textit{S. Khuller}, Lect. Notes Comput. Sci. 382, 303--315 (1989; Zbl 0765.68039)
Deo, Narsingh; Sarkar, Dilip On certain planar coverings of complete graphs. (English) Zbl 0678.05016 Combinatorics, graph theory, and computing, Proc. 19th Southeast. Conf., Boca Raton/Fla. 1988, Congr. Numerantium 66, 33-44 (1988). Reviewer: A.T.White MSC: 05C10 05C70 PDFBibTeX XML
Diks, Krzysztof A fast parallel algorithm for six-colouring of planar graphs. (English) Zbl 0601.05022 Mathematical foundations of computer science, Proc. 12th Symp., Bratislava/Czech. 1986, Lect. Notes Comput. Sci. 233, 273-282 (1986). MSC: 05C15 68R10 68N25 PDFBibTeX XML