On Crossing Sets, Disjoint Sets, and Pagenumber

DOI10.1006/JAGM.1999.1049MaRDI QIDQ4943069zbMATH OpenOpenAlexWikidataFDO

Authors Farhad Shahrokhi, Weiping Shi

Publication date 16 March 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1999.1049

zbMATH Keywords

\(t\)-partite graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Book drawings of complete bipartite graphs
• Pagenumber of complete bipartite graphs
• On the crossing number of 2-page book drawings of K_n with prescribed number of edges in each page
• Graphs with E Edges Have Pagenumber O(√E)
• On the pagenumber of complete bipartite graphs

Cited in

(9)

• Embedding connected double-loop networks with even cardinality in books
• Geometric thickness in a grid
• A survey on book-embedding of planar graphs
• Embedding generalized Petersen graph in books
• Graph layouts via layered separators
• Book embedding of graphs on the projective plane
• Book embeddings of regular graphs
• Queue layouts of planar 3-trees
• Queue layouts of planar 3-trees

This page was built for publication: On Crossing Sets, Disjoint Sets, and Pagenumber

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