Comments on a note by F. Rubin

DOI10.1007/BF02576822zbMath0323.05105OpenAlexW2035840229MaRDI QIDQ1224104

K. Appert

Publication date: 1975

Published in: Calcolo (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• A note on Lerda and Majorani's minimum crossing algorithm
• An algorithm for connecting n points with a minimum number of crossings

This page was built for publication: Comments on a note by F. Rubin