SOFSEM 2005: Theory and Practice of Computer Science

DOI10.1007/B105088zbMATH Open1117.68458OpenAlexW2543951292MaRDI QIDQ5711554FDOQ5711554

Authors: Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrt'o 

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105088

Recommendations

• scientific article; zbMATH DE number 2094521
• The outerplanar crossing number of the complete bipartite graph
• One- and two-page crossing numbers for some types of graphs
• Outerplanar crossing numbers of planar graphs
• Bounding the tripartite‐circle crossing number of complete tripartite graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (6)

• The outerplanar crossing number of the complete bipartite graph
• Title not available (Why is that?)
• One- and two-page crossing numbers for some types of graphs
• Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions
• An improved fixed-parameter algorithm for one-page crossing minimization
• Outerplanar crossing numbers of planar graphs

This page was built for publication: SOFSEM 2005: Theory and Practice of Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711554)