In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns. In particular, every graph in this family of block circulant graphs we investigate has a generating block row that follows a symmetric growth pattern of the all ones matrix. The natural bijection provides an upper bound on the chromatic number for this infinite family of graphs.
|Number of pages
|Electronic Journal of Graph Theory and Applications
|Published - 2019
Bibliographical noteFunding Information:
The authors thank Joseph Pedersen for his work on the Mathematica code that provided much insight. The authors acknowledge Charity Bankhead for her initial computational contributions to this project, and thank William T. Trotter for many helpful and enlightening conversations during the completion of this manuscript. As this project began during the 2013 SACNAS National Conference, the authors thank the society for providing an enriching environment that encouraged this scientific collaboration. The authors extend their gratitude to the Center for Leadership and Diversity in STEM at the United States Military Academy, the National Science Foundation Division of Mathematical Sciences (DMS-1045082), and the AMS-Simons Travel Grant for travel support.
© 2019, Indonesian Combinatorics Society.
- Bipartite poset
- Chromatic number
- Circulant matrix
- Order dimension