The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
From MaRDI portal
Publication:3404427
DOI10.1007/978-3-642-11440-3_4zbMath1274.05328OpenAlexW1590770767WikidataQ62042528 ScholiaQ62042528MaRDI QIDQ3404427
Emilio Di Giacomo, Giuseppe Liotta
Publication date: 9 February 2010
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_4
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Circumscribing polygons and polygonizations for disjoint line segments, Colored anchored visibility representations in 2D and 3D space, On the curve complexity of 3-colored point-set embeddings, Colored Point-Set Embeddings of Acyclic Graphs, Unnamed Item, Plane 3-Trees: Embeddability and Approximation, THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
