theta_0 Graph


The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial


and chromatic number gamma(theta_0)=3.

The puz-graph of a finite simple biconnected graph G that is not polygonal always has two connected components if G is bipartite; otherwise (with the exception of theta_0), puz(G) is connected. Surprisingly, the puz-graph of the theta_0 graph is the sole exception, having six connected components instead of a single component.

See also

15 Puzzle, Puz-Graph

Explore with Wolfram|Alpha


Archer, A. F. "A Modern Treatment of the 15 Puzzle." Amer. Math. Monthly 106, 793-799, 1999.Wilson, R. M. "Graph Puzzles, Homotopy, and the Alternating Group." J. Combin. Th. Ser. B 16, 86-96, 1974.

Cite this as:

Weisstein, Eric W. "theta_0 Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications