Recommendations
- scientific article; zbMATH DE number 1507297
- Plane Embeddings of 2-Trees and Biconnected Partial 2-Trees
- Bipartite embedding of \((p,q)\)-trees
- Embedding complete multipartite graphs into certain trees
- Bijections for a class of labeled plane trees
- In-trees and plane embeddings of outerplanar graphs
- Bijections for 2-plane trees and ternary trees
- Embeddings of binary trees in lines
- Multidimensional bipartite trees
- Lattice embeddings of trees
Cites work
- scientific article; zbMATH DE number 431516 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- Applications of a semi-dynamic convex hull algorithm
- Degree constrained tree embedding into points in the plane
- Optimal Algorithms to Embed Trees in a Point Set
- Simple alternating path problem
- The rooted tree embedding problem into points in the plane
Cited in
(44)- Minimization and maximization versions of the quadratic travelling salesman problem
- Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph
- A note on harmonic subgraphs in labelled geometric graphs
- On plane spanning trees and cycles of multicolored point sets with few intersections
- Three edge-disjoint plane spanning paths in a point set
- Bichromatic point-set embeddings of trees with fewer bends (extended abstract)
- On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
- Bijections for a class of labeled plane trees
- Planar bichromatic minimum spanning trees
- A linear-time approximation algorithm for the minimum-length geometric embedding of trees
- Geometric spanning cycles in bichromatic point sets
- scientific article; zbMATH DE number 6963888 (Why is no real title available?)
- 2-colored point-set embeddings of partial 2-trees
- Long non-crossing configurations in the plane
- Bi-Lipschitz embeddings of trees into Euclidean buildings
- On the length of longest alternating paths for multicoloured point sets in convex position
- Colored simultaneous geometric embeddings and universal pointsets
- Embeddings of binary trees in lines
- 2-colored point-set embeddings of partial 2-trees
- Noncrossing Hamiltonian paths in geometric graphs
- On the curve complexity of 3-colored point-set embeddings
- Three edge-disjoint plane spanning paths in a point set
- Separated matchings and small discrepancy colorings
- Hamiltonian orthogeodesic alternating paths
- Planar straight-line point-set embedding of trees with partial embeddings
- Alternating paths and cycles of minimum length
- Universal point sets for 2-coloured trees
- Planar Bichromatic Bottleneck Spanning Trees
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- Discrete geometry on colored point sets in the plane -- a survey
- Packing plane spanning trees and paths in complete geometric graphs
- SEMI-BALANCED PARTITIONS OF TWO SETS OF POINTS AND EMBEDDINGS OF ROOTED FORESTS
- Minimum plane bichromatic spanning trees
- Minimum plane bichromatic spanning trees
- On geometric graphs on point sets in the plane
- Straight-line embeddings of two rooted trees in the plane
- Binary space partitioning trees as an alternative representation of polytopes
- The Mathematics of Ferran Hurtado: A Brief Survey
- Long alternating paths in bicolored point sets
- On Hamiltonian alternating cycles and paths
- Two trees in maximal planar bipartite graphs
- Graph Drawing
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
- Hamiltonian Alternating Paths on Bicolored Double-Chains
This page was built for publication: Bipartite embeddings of trees in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296568)
