2-colored point-set embeddings of partial 2-trees

DOI10.1016/j.tcs.2021.09.045OpenAlexW4214736620MaRDI QIDQ5925531

Jaroslav Hančl Jr., Emilio Di Giacomo, Giuseppe Liotta

Publication date: 18 November 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.045

zbMATH Keywords

point-set embeddingcurve complexity2-page bipartite book embeddingtopological book embeddings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• NodeTrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating paths and cycles of minimum length
• Curve-constrained drawings of planar graphs
• Geometric planar networks on bichromatic points
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
• Simple alternating path problem
• Drawing colored graphs on colored points
• Drawing colored graphs with constrained vertex positions and few bends per edge
• The book thickness of a graph
• A partial k-arboretum of graphs with bounded treewidth
• Bipartite embeddings of trees in the plane
• The rooted tree embedding problem into points in the plane
• On Hamiltonian alternating cycles and paths
• Track layouts, layered path decompositions, and leveled planarity
• On a straight-line embedding problem of graphs
• Hamiltonian orthogeodesic alternating paths
• On point set embeddings for \(k\)-planar graphs with few bends per edge
• On the curve complexity of 3-colored point-set embeddings
• Book embeddability of series-parallel digraphs
• Computing NodeTrix Representations of Clustered Graphs
• CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS
• Optimal Algorithms to Embed Trees in a Point Set
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
• k-colored Point-set Embeddability of Outerplanar Graphs
• Intersection-Link Representations of Graphs
• Universal Point Sets for Drawing Planar Graphs with Circular Arcs
• ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
• Bichromatic Point-Set Embeddings of Trees with Fewer Bends
• Embedding planar graphs at fixed vertex locations