  The Bron-Kerbosch algorithm is a well known maximal clique enumeration
algorithm. So far it was unknown whether it was output sensitive or not. In
this paper we partially answer this question by proving that the Bron-Kerbosch
Algorithm with vertex ordering, first introduced and studied by Eppstein,
L\"offler and Strash in "Listing all maximal cliques in sparse graphs in
near-optimal time. International Symposium on Algorithms and Computation.
Springer, Berlin, Heidelberg, 2010" is output sensitive.
