
theorem Th62:
  for G being _finite edgeless _Graph
  ex p being non empty _finite edgeless Graph-yielding FinSequence
  st p.1 is _trivial edgeless & p.len p = G & len p = G.order() &
    for n being Element of dom p st n <= len p - 1 holds
    ex v being Vertex of G
    st p.(n+1) is addVertex of p.n,v & not v in the_Vertices_of p.n
proof
  let G be _finite edgeless _Graph;
  set v0 = the Vertex of G;
  set H = the inducedSubgraph of G, {v0};
  consider p being non empty _finite edgeless Graph-yielding FinSequence
    such that
    A1: p.1 == H & p.len p = G & len p = G.order() - H.order() + 1 and
    A2: for n being Element of dom p st n <= len p - 1 holds
      ex v being Vertex of G
      st p.(n+1) is addVertex of p.n, v & not v in the_Vertices_of p.n by Th61;
  take p;
  thus p.1 is _trivial edgeless by A1, Th52, GLIB_000:89;
  thus p.len p = G by A1;
  H.order() = 1 by GLIB_000:26;
  hence len p = G.order() by A1;
  thus thesis by A2;
end;
