The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems (Q810055): Difference between revisions

An hexagonal system is a 2-connected finite plane graph in which each face other than the exterior is bounded by a hexagon. The Z- transformation graph Z(H) of the hexagonal system H has vertices corresponding to the 1-factors of H and two vertices are adjacent if the symmetric difference of their corresponding 1-factors consists of the six edges of a hexagon in H. It is shown that the graph Z(H) has connectivity equal to the minimum degree of a vertex in Z(H).