Note on chromatic polynomials of the threshold graphs
From MaRDI portal
Publication:5009948
DOI10.5614/ejgta.2019.7.2.2zbMath1467.05068OpenAlexW2981101543MaRDI QIDQ5009948
Miloud Mihoubi, Noureddine Chikh
Publication date: 23 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2019.7.2.2
Partitions of sets (05A18) Bell and Stirling numbers (11B73) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The chromatic uniqueness of certain complete \(t\)-partite graphs.
- The general boson normal ordering problem
- Threshold graphs and related topics
- Combinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- An introduction to chromatic polynomials