Use the subgraph relation to define the poset. The big graph is then obviously an upper bound for every chain.
And if we take the poset to be partial colorings ordered by inclusion, it's not the case that a maximal partial coloring must color the entire graph. Some partial colorings have made choices which prevent them from being extended any further.
[To be clear, whenever I say "coloring", I mean from a fixed set of colors. E.g., a 4-coloring.]
So somewhere in the argument, the finiteness of C must play a role. This is in ensuring compactness.