Szabó, Sándor; Zavalnij, Bogdan Decomposing clique search problems into smaller instances based on node and edge colorings. (English) Zbl 1384.05127 Discrete Appl. Math. 242, 118-129 (2018). MSC: 05C69 05C70 90C27 PDFBibTeX XMLCite \textit{S. Szabó} and \textit{B. Zavalnij}, Discrete Appl. Math. 242, 118--129 (2018; Zbl 1384.05127) Full Text: DOI
Absil, Romain; Camby, Eglantine; Hertz, Alain; Mélot, Hadrien A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\). (English) Zbl 1376.05044 Discrete Appl. Math. 234, 3-11 (2018). MSC: 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{R. Absil} et al., Discrete Appl. Math. 234, 3--11 (2018; Zbl 1376.05044) Full Text: DOI
Gu, Nancy S. S.; Prodinger, Helmut Bijections for 2-plane trees and ternary trees. (English) Zbl 1192.05031 Eur. J. Comb. 30, No. 4, 969-985 (2009). MSC: 05C05 05C15 05C78 PDFBibTeX XMLCite \textit{N. S. S. Gu} and \textit{H. Prodinger}, Eur. J. Comb. 30, No. 4, 969--985 (2009; Zbl 1192.05031) Full Text: DOI
Bordewich, Magnus; Dyer, Martin; Karpinski, Marek Path coupling using stopping times and counting independent sets and colorings in hypergraphs. (English) Zbl 1181.05061 Random Struct. Algorithms 32, No. 3, 375-399 (2008). MSC: 05C65 05C69 05C30 05C15 68W20 68Q25 60C05 60J05 PDFBibTeX XMLCite \textit{M. Bordewich} et al., Random Struct. Algorithms 32, No. 3, 375--399 (2008; Zbl 1181.05061) Full Text: DOI arXiv