reserve E,V for set, G,G1,G2 for _Graph, c,c1,c2 for Cardinal, n for Nat;
reserve f for VColoring of G;
reserve g for EColoring of G;
reserve t for TColoring of G;

theorem Th206:
  for F being PGraphMapping of G1, G2
  st F is isomorphism holds G1.tChromaticNum() = G2.tChromaticNum()
proof
  let F be PGraphMapping of G1, G2;
  assume A1: F is isomorphism;
  per cases;
  suppose G1 is non loopless;
    then G1 is non loopless & G2 is non loopless by A1, GLIB_010:35;
    then G1.tChromaticNum() = 0 & G2.tChromaticNum() = 0;
    hence thesis;
  end;
  suppose A2: G1 is loopless;
    now
      G1 is G1.tChromaticNum()-tcolorable by A2, Th186;
      hence G2 is G1.tChromaticNum()-tcolorable by A1, Th177;
      let c;
      assume G2 is c-tcolorable;
      then G1 is c-tcolorable by A1, Th177;
      hence G1.tChromaticNum() c= c by Th189;
    end;
    hence thesis by Th190;
  end;
end;
