On P 3-Convexity of Graphs with Bounded Degree

DOI10.1007/978-3-319-07956-1_24zbMath1445.68159OpenAlexW2209405085MaRDI QIDQ5251650

Fábio Protti, Dieter Rautenbach, Uéverton S. Souza, Lucia Draque Penso

Publication date: 20 May 2015

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07956-1_24

zbMATH Keywords

planar graphsNP-hardnessbounded degree\(P_{3}\)-convexity\(P_{3}\)-geodetic set\(P_{3}\)-hull set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On reconfigurability of target sets

This page was built for publication: On P 3-Convexity of Graphs with Bounded Degree