In this paper we consider the sequential and parallel complexity of the maximum matching problem in chordal and strongly chordal graphs. We prove that, given a strongly perfect elimination ordering, a maximum matching in a strongly chordal graph can be found in a linear time. On the other hand we observe that the matching problem restricted to chordal (paths) graphs is of the same parallel complexiy as a general bipartite matching.