Intersection number of two connected geometric graphs

DOI10.1016/0020-0190(96)00124-XMaRDI QIDQ1350920zbMATH OpenWikidataFDO

Authors Shin-ichi Tokunaga

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00124-X

zbMATH Keywords

Combinatorial problemsFinite points in the planeGeometric graphs

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the Red/Blue Spanning Tree Problem
• On the number of intersections of three monochromatic trees in the plane
• Connecting colored point sets
• Geometric spanning cycles in bichromatic point sets

Cites work

• Disjoint edges in geometric graphs
• scientific article; zbMATH DE number 3896968 (Why is no real title available?)
• Problem-solving through problems
• Simple alternating path problem

Cited in

(17)

• Colored spanning graphs for set visualization
• A note on two geometric paths with few crossings for points labeled by integers in the plane
• Monochromatic plane matchings in bicolored point set
• Geometric spanning cycles in bichromatic point sets
• A note on harmonic subgraphs in labelled geometric graphs
• On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
• Discrete geometry on colored point sets in the plane -- a survey
• On geometric graphs on point sets in the plane
• scientific article; zbMATH DE number 9664 (Why is no real title available?)
• ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
• Non-crossing geometric Steiner arborescences
• On the red/blue spanning tree problem
• Combinatorial Geometry and Graph Theory
• On the number of intersections of three monochromatic trees in the plane
• Crossing-free monochromatic trees for bicolored point sets
• On plane spanning trees and cycles of multicolored point sets with few intersections
• Connecting colored point sets

This page was built for publication: Intersection number of two connected geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350920)