The Adjacency of Clar Polyhedron
Shuyan Jiang · 2010
Hansen and Zheng formulated the Clar number problem for hexagonal system as an integer program. Chvatal gave the necessary and sufficient condition for two matching being adjacent.Motivated by this,we get a necessary and sufficient condition for the adjacency of two Clar coverings in the Clar polyhedron,which is the convex hull of the feasible solutions set of the integer programming model of the hexagonal system.Also,we obtain the dimension of a Clar polyhedron.