The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing

DOI10.1007/978-3-642-11440-3_4MaRDI QIDQ3404427zbMATH OpenOpenAlexWikidataFDO

Authors 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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• scientific article; zbMATH DE number 2081003
• scientific article; zbMATH DE number 177556
• Graph Drawing
• On finding augmenting graphs
• scientific article; zbMATH DE number 5917762
• The Hamiltonian problem and \(t\)-path traceable graphs
• scientific article; zbMATH DE number 786156
• scientific article; zbMATH DE number 5778154
• scientific article; zbMATH DE number 5184446
• An s-Hamiltonian line graph problem

Cited in

(10)

• Colored anchored visibility representations in 2D and 3D space
• On the curve complexity of 3-colored point-set embeddings
• Circumscribing polygons and polygonizations for disjoint line segments
• The point-set embeddability problem for plane graphs
• Colored Point-Set Embeddings of Acyclic Graphs
• Circumscribing polygons and polygonizations for disjoint line segments
• Plane 3-trees: embeddability and approximation
• A tight subexponential-time algorithm for two-page book embedding
• Recognition complexity of subgraphs of \({\mathbf{k}}\)-connected planar cubic graphs
• Efficient recognition of subgraphs of planar cubic bridgeless graphs

This page was built for publication: The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing

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