Bonizzoni, Paola; De Felice, Clelia; Zaccagnino, Rocco; Zizza, Rosalba Unavoidable sets, prefix graphs and regularity of circular splicing languages. (English) Zbl 1435.68146 Fundam. Inform. 171, No. 1-4, 81-95 (2020). MSC: 68Q45 68Q07 PDF BibTeX XML Cite \textit{P. Bonizzoni} et al., Fundam. Inform. 171, No. 1--4, 81--95 (2020; Zbl 1435.68146) Full Text: DOI
Jojić, Duško; Marzantowicz, Wacław; Vrećica, Siniša T.; Živaljević, Rade T. Unavoidable complexes, via an elementary equivariant index theory. (English) Zbl 1435.05241 J. Fixed Point Theory Appl. 22, No. 2, Paper No. 31, 12 p. (2020). MSC: 05E45 52A35 55S35 55U10 55N25 57Q35 PDF BibTeX XML Cite \textit{D. Jojić} et al., J. Fixed Point Theory Appl. 22, No. 2, Paper No. 31, 12 p. (2020; Zbl 1435.05241) Full Text: DOI
De Felice, Clelia; Zaccagnino, Rocco; Zizza, Rosalba Unavoidable sets and circular splicing languages. (English) Zbl 1355.68155 Theor. Comput. Sci. 658, Part A, 148-158 (2017). MSC: 68Q45 PDF BibTeX XML Cite \textit{C. De Felice} et al., Theor. Comput. Sci. 658, Part A, 148--158 (2017; Zbl 1355.68155) Full Text: DOI
Blanchet-Sadri, F.; Ji, Steven; Reiland, Elizabeth Number of holes in unavoidable sets of partial words. II. (English) Zbl 1273.68288 J. Discrete Algorithms 14, 65-73 (2012). MSC: 68R15 68Q17 68Q45 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., J. Discrete Algorithms 14, 65--73 (2012; Zbl 1273.68288) Full Text: DOI
Blanchet-Sadri, F.; Chen, Bob; Chakarov, Aleksandar Number of holes in unavoidable sets of partial words. I. (English) Zbl 1273.68287 J. Discrete Algorithms 14, 55-64 (2012). MSC: 68R15 68Q45 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., J. Discrete Algorithms 14, 55--64 (2012; Zbl 1273.68287) Full Text: DOI
Lopez-Abad, J.; Todorcevic, S. Generic Banach spaces and generic simplexes. (English) Zbl 1235.46012 J. Funct. Anal. 261, No. 2, 300-386 (2011). Reviewer: Daniel Li (Lens) MSC: 46B03 46B26 03C25 46A55 PDF BibTeX XML Cite \textit{J. Lopez-Abad} and \textit{S. Todorcevic}, J. Funct. Anal. 261, No. 2, 300--386 (2011; Zbl 1235.46012) Full Text: DOI
Blanchet-Sadri, Francine; Blakeley, Brandon; Gunter, Josh; Simmons, Sean; Weissenstein, Eric Classifying all avoidable sets of partial words of size two. (English) Zbl 1228.68041 Martín-Vide, Carlos (ed.), Scientific applications of language methods. London: Imperial College Press (ISBN 978-1-84816-544-1/hbk; 978-1-84816-545-8/ebook). Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory 2, 59-101 (2011). MSC: 68R15 05C25 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., in: Scientific applications of language methods. London: Imperial College Press. 59--101 (2011; Zbl 1228.68041)
Blakeley, Brandon; Blanchet-Sadri, F.; Gunter, Josh; Rampersad, Narad On the complexity of deciding avoidability of sets of partial words. (English) Zbl 1208.68164 Theor. Comput. Sci. 411, No. 49, 4263-4271 (2010). MSC: 68R15 68Q25 PDF BibTeX XML Cite \textit{B. Blakeley} et al., Theor. Comput. Sci. 411, No. 49, 4263--4271 (2010; Zbl 1208.68164) Full Text: DOI
Blanchet-Sadri, F.; Brownstein, N. C.; Kalcic, Andy; Palumbo, Justin; Weyand, T. Unavoidable sets of partial words. (English) Zbl 1187.68358 Theory Comput. Syst. 45, No. 2, 381-406 (2009). MSC: 68R15 68Q45 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., Theory Comput. Syst. 45, No. 2, 381--406 (2009; Zbl 1187.68358) Full Text: DOI
Blanchet-Sadri, F.; Jungers, Raphaël M.; Palumbo, Justin Testing avoidability on sets of partial words is hard. (English) Zbl 1162.68028 Theor. Comput. Sci. 410, No. 8-10, 968-972 (2009). MSC: 68R15 68Q17 PDF BibTeX XML Cite \textit{F. Blanchet-Sadri} et al., Theor. Comput. Sci. 410, No. 8--10, 968--972 (2009; Zbl 1162.68028) Full Text: DOI
Bell, Jason P. Unavoidable and almost unavoidable sets of words. (English) Zbl 1073.68066 Int. J. Algebra Comput. 15, No. 4, 717-724 (2005). MSC: 68R15 05A99 PDF BibTeX XML Cite \textit{J. P. Bell}, Int. J. Algebra Comput. 15, No. 4, 717--724 (2005; Zbl 1073.68066) Full Text: DOI
D’Alessandro, Flavio; Varricchio, Stefano Well quasi-orders and context-free grammars. (English) Zbl 1071.68033 Theor. Comput. Sci. 327, No. 3, 255-268 (2004). MSC: 68Q42 PDF BibTeX XML Cite \textit{F. D'Alessandro} and \textit{S. Varricchio}, Theor. Comput. Sci. 327, No. 3, 255--268 (2004; Zbl 1071.68033) Full Text: DOI
Ounaies, Myriam Inverse images of unavoidable sets by holomorphic mappings from \(\mathbb{C}^n\) to \(\mathbb{C}^n\). (Images réciproques d’ensembles inévitables par les applications holomorphes de \(\mathbb C^n\) dans \(\mathbb C^n\).) (French) Zbl 1026.32040 Complex Variables, Theory Appl. 47, No. 4, 361-371 (2002). Reviewer: Myriam Ounaies (Strasbourg) MSC: 32H30 32A22 32A15 PDF BibTeX XML Cite \textit{M. Ounaies}, Complex Variables, Theory Appl. 47, No. 4, 361--371 (2002; Zbl 1026.32040) Full Text: DOI
Choffrut, C. Avoidable subsets of words. (Spanish. French summary) Zbl 0656.68083 Rev. Mat. Apl. 9, No. 2, 36-41 (1988). Reviewer: Gh.Păun MSC: 68Q45 68P10 20M35 PDF BibTeX XML Cite \textit{C. Choffrut}, Rev. Mat. Apl. 9, No. 2, 36--41 (1988; Zbl 0656.68083)
Choffrut, C.; Culik, K. II On extendibility of unavoidable subsets of a free monoid. (Portuguese) Zbl 0645.68084 Proc. 15th Braz. Colloq. Math., Poços de Caldas/Braz. 1985, 139-148 (1987). MSC: 68Q45 20M35 20M05 PDF BibTeX XML
Aigner, Martin Graph theory. A development from the 4-color problem. Transl. from the German and ed. by L. Boron, C. Christenson and B. Smith, with the collab. of the author. (English) Zbl 0606.05020 Moscow, Idaho, USA: BCS Associates. VII, 226 p.; S 28.00 (1987). MSC: 05Cxx 05-02 05C15 PDF BibTeX XML
Dare, V. Rajkumar; Siromoney, Rani Subword topology. (English) Zbl 0638.68076 Theor. Comput. Sci. 47, 159-168 (1986). MSC: 68Q45 PDF BibTeX XML Cite \textit{V. R. Dare} and \textit{R. Siromoney}, Theor. Comput. Sci. 47, 159--168 (1986; Zbl 0638.68076) Full Text: DOI
Bucher, W.; Ehrenfeucht, A.; Haussler, D. On total regulators generated by derivation relations. (English) Zbl 0606.68074 Theor. Comput. Sci. 40, 131-148 (1985). MSC: 68Q45 PDF BibTeX XML Cite \textit{W. Bucher} et al., Theor. Comput. Sci. 40, 131--148 (1985; Zbl 0606.68074) Full Text: DOI
Woodall, D. R.; Wilson, Robin J. The Appel-Haken proof of the four-color theorem. (English) Zbl 0432.05025 Selected topics in graph theory, 83-101 (1978). MSC: 05C15 PDF BibTeX XML
Saaty, Thomas L.; Kainen, Paul C. The four-color problem. Assaults and conquest. (English) Zbl 0463.05041 Advanced Book Program. Düsseldorf etc.: McGraw-Hill International Book Company. IX, 217 p. DM 51.70 (1977). MSC: 05C15 05-02 PDF BibTeX XML