<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def is_vertex_coloring(G, coloring):
 """Determines whether the given coloring is a vertex coloring of graph G. Parameters G : NetworkX graph The graph on which the vertex coloring is applied. coloring : dict A coloring of the nodes of G. Should be a dict of the form Returns ------- is_vertex_coloring : bool True if the given coloring defines a vertex coloring; that is, no two adjacent vertices share a color. Example ------- This example colors checks two colorings for a graph, G, of a single Chimera unit cell. The first uses one color (0) for the four horizontal qubits and another (1) for the four vertical qubits, in which case there are no adjacencies; the second coloring swaps the color of one node. True False """

    return all(coloring[u] != coloring[v] for u, v in G.edges)