A crown graph is a complete bipartite graph with a perfect matching removed. For it has chromatic number two, but greedy coloring in the order uses colors: the matched pair gets the same new color, and every subsequent pair sees all earlier colors.
Articles by others on the same topic
A crown graph is a specific type of graph in graph theory. It is denoted as \( C_n \) and is defined as the graph that consists of two cycles \( C_n \) and \( C_{n+1} \) that are connected in a certain way. More formally, a crown graph can be defined as follows: 1. **Vertices**: The crown graph has \( 2n \) vertices, which can be represented as two disjoint cycles.