An integral graph is a graph whose spectrum (of its adjacency matrix) consists entirely of integers. Here we prove some results on bipartite, nonregular integral graphs with maximum degree four. In particular, trees, unicyclic graphs and graphs with some numbers excluded from their spectrum are considered.