Piercing diametral disks induced by edges of maximum spanning trees

DOI10.7155/JGAA.V28I3.2968MaRDI QIDQ6636995

Paz Carmi, A. Karim Abu-Affash, Meytal Maman

Publication date: 12 November 2024

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

Helly's theoremmaximum spanning treepiercing setFingerhut's conjecture

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tverberg's theorem, disks, and Hamiltonian cycles
• Computing Euclidean maximum spanning trees
• Über Mengen konvexer Körper mit gemeinschaftlichen Punkten.
• Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten.
• Stabbing pairwise intersecting disks by five points
• Matching points with disks with a common intersection
• On maximum-sum matchings of points
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Stabbing pairwise intersecting disks by four points
• Intersecting diametral balls induced by a geometric graph

This page was built for publication: Piercing diametral disks induced by edges of maximum spanning trees

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