We show NP-hardness of determining the branchwidth of split graphs and a polynomial time algorithm for interval graphs.
