Pêcher, Arnaud; Wagler, Annegret K. On circular-perfect graphs: a survey. (English) Zbl 1458.05087 Eur. J. Comb. 91, Article ID 103224, 17 p. (2021). MSC: 05C17 05C15 05C75 PDFBibTeX XMLCite \textit{A. Pêcher} and \textit{A. K. Wagler}, Eur. J. Comb. 91, Article ID 103224, 17 p. (2021; Zbl 1458.05087) Full Text: DOI
Pêcher, Arnaud; Wagler, Annegret K. Computing clique and chromatic number of circular-perfect graphs in polynomial time. (English) Zbl 1280.90102 Math. Program. 141, No. 1-2 (A), 121-133 (2013). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{A. Pêcher} and \textit{A. K. Wagler}, Math. Program. 141, No. 1--2 (A), 121--133 (2013; Zbl 1280.90102) Full Text: DOI
Pêcher, Arnaud; Wagler, Annegret K. Clique and chromatic number of circular-perfect graphs. (English) Zbl 1237.90245 Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 199-206 (2010). MSC: 90C35 05C85 90C27 PDFBibTeX XMLCite \textit{A. Pêcher} and \textit{A. K. Wagler}, Electron. Notes Discrete Math. 36, 199--206 (2010; Zbl 1237.90245) Full Text: DOI
Pêcher, Arnaud; Wagler, Annegret K. On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs. (English) Zbl 1268.05083 Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 53-58 (2009). MSC: 05C15 05C17 PDFBibTeX XMLCite \textit{A. Pêcher} and \textit{A. K. Wagler}, Electron. Notes Discrete Math. 35, 53--58 (2009; Zbl 1268.05083) Full Text: DOI
Coulonges, Sylvain; Pêcher, Arnaud; Wagler, Annegret K. Triangle-free strongly circular-perfect graphs. (English) Zbl 1229.05109 Discrete Math. 309, No. 11, 3632-3643 (2009). MSC: 05C17 PDFBibTeX XMLCite \textit{S. Coulonges} et al., Discrete Math. 309, No. 11, 3632--3643 (2009; Zbl 1229.05109) Full Text: DOI
Pêcher, Arnaud; Wagler, Annegret K. On classes of minimal circular-imperfect graphs. (English) Zbl 1151.05025 Discrete Appl. Math. 156, No. 7, 998-1010 (2008). Reviewer: Lai Chunhui (Zhangzhou) MSC: 05C35 05C17 PDFBibTeX XMLCite \textit{A. Pêcher} and \textit{A. K. Wagler}, Discrete Appl. Math. 156, No. 7, 998--1010 (2008; Zbl 1151.05025) Full Text: DOI
Kuhpfahl, Jens; Wagler, Annegret K.; Wagner, Christian Circular-imperfection of triangle-free graphs. (English) Zbl 1341.05093 Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 163-167 (2007). MSC: 05C17 05C15 PDFBibTeX XMLCite \textit{J. Kuhpfahl} et al., Electron. Notes Discrete Math. 29, 163--167 (2007; Zbl 1341.05093) Full Text: DOI
Coulonges, Sylvain; Pêcher, Arnaud; Wagler, Annegret K. On strongly circular-perfectness. (English) Zbl 1200.05077 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 369-374 (2005). MSC: 05C15 05C17 PDFBibTeX XMLCite \textit{S. Coulonges} et al., Electron. Notes Discrete Math. 22, 369--374 (2005; Zbl 1200.05077) Full Text: DOI