theorem Th192:
  for G being loopless _Graph holds G.eChromaticNum() c= G.tChromaticNum()
proof
  let G be loopless _Graph;
  G is G.tChromaticNum()-tcolorable by Th186;
  hence thesis by Th162, Lm15;
end;
