Block circulant graphs and the graphs of critical pairs of crowns
From MaRDI portal
(Redirected from Block circulant graphs and the graphs of critical pairs of crowns)
Abstract: 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.
Recommendations
Cites work
- A Poset Dimension Algorithm
- Computational Science and Its Applications – ICCSA 2004
- Dimension of the crown \(S^k_n\)
- Dimension, graph and hypergraph coloring
- Graph theory
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 863477 (Why is no real title available?)
- scientific article; zbMATH DE number 3327124 (Why is no real title available?)
Cited in
(3)
This page was built for publication: Block circulant graphs and the graphs of critical pairs of crowns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009946)