Engbers, John; Erey, Aysel; Fox, Jacob; He, Xiaoyu Tomescu’s graph coloring conjecture for \(\ell\)-connected graphs. (English) Zbl 1468.05075 SIAM J. Discrete Math. 35, No. 2, 1478-1502 (2021). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C15 05C40 PDF BibTeX XML Cite \textit{J. Engbers} et al., SIAM J. Discrete Math. 35, No. 2, 1478--1502 (2021; Zbl 1468.05075) Full Text: DOI arXiv OpenURL
Knox, Fiachra; Mohar, Bojan Maximum number of colourings: 4-chromatic graphs. (English) Zbl 1443.05070 J. Comb. Theory, Ser. B 144, 95-118 (2020). MSC: 05C15 05C31 PDF BibTeX XML Cite \textit{F. Knox} and \textit{B. Mohar}, J. Comb. Theory, Ser. B 144, 95--118 (2020; Zbl 1443.05070) Full Text: DOI arXiv OpenURL
Knox, Fiachra; Mohar, Bojan Maximum number of colourings: 5-chromatic case. (English) Zbl 1419.05077 Electron. J. Comb. 26, No. 3, Research Paper P3.40, 10 p. (2019). MSC: 05C15 05C35 PDF BibTeX XML Cite \textit{F. Knox} and \textit{B. Mohar}, Electron. J. Comb. 26, No. 3, Research Paper P3.40, 10 p. (2019; Zbl 1419.05077) Full Text: Link OpenURL
Fox, Jacob; He, Xiaoyu; Manners, Freddie A proof of Tomescu’s graph coloring conjecture. (English) Zbl 1414.05114 J. Comb. Theory, Ser. B 136, 204-221 (2019). MSC: 05C15 PDF BibTeX XML Cite \textit{J. Fox} et al., J. Comb. Theory, Ser. B 136, 204--221 (2019; Zbl 1414.05114) Full Text: DOI arXiv OpenURL
Engbers, John; Erey, Aysel Extremal colorings and independent sets. (English) Zbl 1402.05064 Graphs Comb. 34, No. 6, 1347-1361 (2018). MSC: 05C15 05C69 05C35 PDF BibTeX XML Cite \textit{J. Engbers} and \textit{A. Erey}, Graphs Comb. 34, No. 6, 1347--1361 (2018; Zbl 1402.05064) Full Text: DOI Link OpenURL
Erey, Aysel Maximizing the number of \(x\)-colorings of 4-chromatic graphs. (English) Zbl 1383.05099 Discrete Math. 341, No. 5, 1419-1431 (2018). MSC: 05C15 PDF BibTeX XML Cite \textit{A. Erey}, Discrete Math. 341, No. 5, 1419--1431 (2018; Zbl 1383.05099) Full Text: DOI arXiv OpenURL
Brown, Jason; Erey, Aysel New bounds for chromatic polynomials and chromatic roots. (English) Zbl 1314.05061 Discrete Math. 338, No. 11, 1938-1946 (2015). MSC: 05C15 05C31 PDF BibTeX XML Cite \textit{J. Brown} and \textit{A. Erey}, Discrete Math. 338, No. 11, 1938--1946 (2015; Zbl 1314.05061) Full Text: DOI arXiv OpenURL
Tomescu, Ioan Le nombre maximal de colorations d’un graphe Hamiltonien. (French) Zbl 0344.05119 Discrete Math. 16(1976), 353-359 (1977). MSC: 05C15 05C35 57M15 PDF BibTeX XML Cite \textit{I. Tomescu}, Discrete Math. 16, 353--359 (1977; Zbl 0344.05119) Full Text: DOI OpenURL
Tomescu, Ioan Une caractérisation des graphes K-chromatiques minimaux sans sommet isole. (French) Zbl 0239.05116 Rev. Franc. Automat. Inform. Rech. Operat. 6, No.R-1, 88-91 (1972). MSC: 05C15 05C35 PDF BibTeX XML Cite \textit{I. Tomescu}, Rev. Franc. Automat. Inform. Rech. Operat., R 6, No. 1, 88--91 (1972; Zbl 0239.05116) Full Text: DOI EuDML OpenURL