
theorem Th49:
  for G being _finite _Graph holds dom ((LexBFS:CSeq(G)).Result())
  `1 = the_Vertices_of G
proof
  let G be _finite _Graph;
  set CS = LexBFS:CSeq(G);
  set CSO = CS.(G.order());
  CS.Result() = CSO by Th37;
  hence thesis by Th36;
end;
