Bipartite embeddings of trees in the plane

DOI10.1016/S0166-218X(99)00042-6zbMath0929.05021OpenAlexW2125861228WikidataQ128089784 ScholiaQ128089784MaRDI QIDQ1296568

Pedro A. Ramos, Manuel Abellanas, Marc Noy, Gregorio Hernández, Jesús García-López

Publication date: 2 August 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00042-6

zbMATH Keywords

treeplanebipartite embeddings

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Minimization and maximization versions of the quadratic travelling salesman problem, On plane spanning trees and cycles of multicolored point sets with few intersections, Packing plane spanning trees and paths in complete geometric graphs, A note on harmonic subgraphs in labelled geometric graphs, Plane bichromatic trees of low degree, Unnamed Item, Alternating paths and cycles of minimum length, Discrete geometry on colored point sets in the plane -- a survey, Long non-crossing configurations in the plane, Noncrossing Hamiltonian paths in geometric graphs, Hamiltonian orthogeodesic alternating paths, The Mathematics of Ferran Hurtado: A Brief Survey, On Hamiltonian alternating cycles and paths, On geometric graphs on point sets in the plane, Universal point sets for 2-coloured trees, On the curve complexity of 3-colored point-set embeddings, Planar Bichromatic Bottleneck Spanning Trees, Separated Matchings and Small Discrepancy Colorings, Long alternating paths in bicolored point sets, Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon, Colored simultaneous geometric embeddings and universal pointsets, On the length of longest alternating paths for multicoloured point sets in convex position, Hamiltonian Alternating Paths on Bicolored Double-Chains, The balanced connected subgraph problem, 2-colored point-set embeddings of partial 2-trees, 2-colored point-set embeddings of partial 2-trees, Planar straight-line point-set embedding of trees with partial embeddings, ON EMBEDDING A GRAPH ON TWO SETS OF POINTS, Planar bichromatic minimum spanning trees, On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets, Geometric spanning cycles in bichromatic point sets, Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph

Cites Work

• Unnamed Item
• Unnamed Item
• Simple alternating path problem
• Applications of a semi-dynamic convex hull algorithm
• Degree constrained tree embedding into points in the plane
• The rooted tree embedding problem into points in the plane
• Optimal Algorithms to Embed Trees in a Point Set