Intersection number of two connected geometric graphs

DOI10.1016/0020-0190(96)00124-XzbMath0900.68426WikidataQ126550470 ScholiaQ126550470MaRDI QIDQ1350920

Shin-ichi Tokunaga

Publication date: 27 February 1997

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

zbMATH Keywords

Combinatorial problemsFinite points in the planeGeometric graphs

Mathematics Subject Classification ID

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

Related Items (12)

On plane spanning trees and cycles of multicolored point sets with few intersections ⋮ A note on harmonic subgraphs in labelled geometric graphs ⋮ Connecting colored point sets ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Colored spanning graphs for set visualization ⋮ A note on two geometric paths with few crossings for points labeled by integers in the plane ⋮ On geometric graphs on point sets in the plane ⋮ ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE ⋮ On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets ⋮ Monochromatic plane matchings in bicolored point set ⋮ Geometric spanning cycles in bichromatic point sets ⋮ Non-crossing geometric steiner arborescences

Cites Work

• Unnamed Item
• Problem-solving through problems
• Simple alternating path problem
• Disjoint edges in geometric graphs

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