Graph Drawing
From MaRDI portal
Publication:5711621
DOI10.1007/b105810zbMath1111.68591OpenAlexW4206160220WikidataQ56267165 ScholiaQ56267165MaRDI QIDQ5711621
Jan Kynčl, János Pach, Géza Tóth
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/b105810
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
A note on harmonic subgraphs in labelled geometric graphs ⋮ Upper bounds for the necklace folding problems ⋮ Hamiltonian Alternating Paths on Bicolored Double-Chains ⋮ Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position
This page was built for publication: Graph Drawing
