On covering bridged plane triangulations with balls

DOI10.1002/jgt.10130zbMath1028.05085OpenAlexW2604592631MaRDI QIDQ4434549

Victor Chepoi, Yann Vaxès

Publication date: 10 November 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10130

zbMATH Keywords

coveringballsplane triangulations

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• On local convexity in graphs
• On bridged graphs and cop-win graphs
• Bridged graphs are cop-win graphs: An algorithmic proof
• Decomposition and \(l_1\)-embedding of weakly median graphs
• Curvature and geometry of tessellating plane graphs
• Graphs of some CAT(0) complexes
• Conditions for invariance of set diameters under d-convexification in a graph
• The 6-property for simplicial complexes and a combinatorial Cartan-Hadamard theorem for manifolds
• Domination numbers of planar graphs
• A maximum principle for graphs