On a straight-line embedding problem of graphs
From MaRDI portal
Publication:1916126
DOI10.1016/0012-365X(95)00201-7zbMath0911.05030OpenAlexW1986542256MaRDI QIDQ1916126
Publication date: 2 July 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)00201-7
Related Items
On Hamiltonian alternating cycles and paths ⋮ Computing optimal islands ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Point-set embeddings of trees with given partial drawings ⋮ SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS ⋮ Straight line embeddings of rooted star forests in the plane ⋮ Long alternating paths in bicolored point sets ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ ON EMBEDDING A GRAPH ON TWO SETS OF POINTS ⋮ Constrained Point Set Embedding of a Balanced Binary Tree
Cites Work
