# The Geodetic Hull Number is Hard for Chordal Graphs

## TL;DR

This paper proves that determining the geodetic hull number is computationally hard for chordal graphs, highlighting a significant complexity challenge in this graph class.

## Contribution

It establishes the NP-hardness of computing the geodetic hull number specifically for chordal graphs, a previously unresolved problem.

## Key findings

- Geodetic hull number is NP-hard for chordal graphs
- Complexity results impact algorithms for related graph problems
- Highlights difficulty in exact computation for this graph class

## Abstract

We show the hardness of the geodetic hull number for chordal graphs.