Encompassing colored planar straight line graphs

DOI10.1016/J.COMGEO.2007.05.006zbMath1124.05034OpenAlexW2013115769MaRDI QIDQ2456662

Csaba D. Tóth, David Rappaport, Ferran Hurtado, Mikio Kano

Publication date: 19 October 2007

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.05.006

zbMATH Keywords

spanning treecolorGeometric graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Plane bichromatic trees of low degree ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Long non-crossing configurations in the plane ⋮ Linear transformation distance for bichromatic matchings ⋮ Plane hop spanners for unit disk graphs: simpler and better ⋮ Compatible spanning trees ⋮ Augmenting the connectivity of geometric graphs ⋮ Structural properties of bichromatic non-crossing matchings ⋮ Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees ⋮ Pointed binary encompassing trees: simple and optimal ⋮ Vertex-colored encompassing graphs ⋮ Planar bichromatic minimum spanning trees ⋮ Bichromatic compatible matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Problem-solving through problems
• Simple alternating path problem
• Alternating paths through disjoint line segments
• On circumscribing polygons for line segments
• Segment endpoint visibility graphs are Hamiltonian
• Illuminating disjoint line segments in the plane
• ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
• Growing a Tree from Its Branches
• Every set of disjoint line segments admits a binary tree

This page was built for publication: Encompassing colored planar straight line graphs