2014/10/19 by Rebecca Garcia, Pamela E. Harris, Garcia, Rebecca E. +7
Computer Science · Mathematics · #05C15 #06A06 #06A07 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.1410.5087
openalex publication_date 2014/10/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.