New bounds on the classical and quantum communication complexity of some graph properties