Crossing minimization for symmetries

DOI10.1007/S00224-005-1142-5MaRDI QIDQ1780845zbMATH OpenOpenAlexFDO

Authors Christoph Buchheim, Seok-Hee Hong

Publication date 14 June 2005

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-005-1142-5

zbMATH Keywords

edge crossings

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1979530
• scientific article; zbMATH DE number 2084277
• scientific article; zbMATH DE number 1389215
• scientific article; zbMATH DE number 1487879
• Some provably hard crossing number problems

Cited in

(7)

• Testing planarity of geometric automorphisms in linear time
• Geometric automorphism groups of graphs
• Symmetric Unions Without Cosmetic Crossing Changes
• scientific article; zbMATH DE number 2084277 (Why is no real title available?)
• scientific article; zbMATH DE number 1979530 (Why is no real title available?)
• scientific article; zbMATH DE number 1389215 (Why is no real title available?)
• Symmetries of cross caps

This page was built for publication: Crossing minimization for symmetries

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