On Crossing Sets, Disjoint Sets, and Pagenumber

DOI10.1006/jagm.1999.1049zbMath0958.68130OpenAlexW2022800658WikidataQ61067927 ScholiaQ61067927MaRDI QIDQ4943069

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)

Related Items (9)

Embedding generalized Petersen graph in books ⋮ A survey on book-embedding of planar graphs ⋮ Geometric thickness in a grid ⋮ Graph layouts via layered separators ⋮ Queue layouts of planar 3-trees ⋮ Queue layouts of planar 3-trees ⋮ Embedding connected double-loop networks with even cardinality in books ⋮ Book Embedding of Graphs on the Projective Plane ⋮ Book Embeddings of Regular Graphs

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