Fiala, Jiří; Rutter, Ignaz; Stumpf, Peter; Zeman, Peter Extending partial representations of circular-arc graphs. (English) Zbl 07682413 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 230-243 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{J. Fiala} et al., Lect. Notes Comput. Sci. 13453, 230--243 (2022; Zbl 07682413) Full Text: DOI arXiv
Fiala, Jiří; Hubička, Jan; Long, Yangjing Gaps in full homomorphism order. (English) Zbl 1378.05134 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 429-435 (2017). MSC: 05C60 PDFBibTeX XMLCite \textit{J. Fiala} et al., Electron. Notes Discrete Math. 61, 429--435 (2017; Zbl 1378.05134) Full Text: DOI arXiv
Fiala, Jiří; Hubička, Jan; Long, Yangjing; Nešetřil, Jaroslav Fractal property of the graph homomorphism order. (English) Zbl 1369.05149 Eur. J. Comb. 66, 101-109 (2017). MSC: 05C60 PDFBibTeX XMLCite \textit{J. Fiala} et al., Eur. J. Comb. 66, 101--109 (2017; Zbl 1369.05149) Full Text: DOI arXiv
Fiala, Jiří; Hubička, Jan; Long, Yangjing An universality argument for graph homomorphisms. (English) Zbl 1346.05190 Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 643-649, electronic only (2015). MSC: 05C60 20C99 PDFBibTeX XMLCite \textit{J. Fiala} et al., Electron. Notes Discrete Math. 49, 643--649 (2015; Zbl 1346.05190) Full Text: DOI
Chaplick, Steven; Fiala, Jiří; van ’t Hof, Pim; Paulusma, Daniël; Tesař, Marek Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. (English) Zbl 1430.68122 Theor. Comput. Sci. 590, 86-95 (2015). MSC: 68Q25 05C60 68Q17 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Theor. Comput. Sci. 590, 86--95 (2015; Zbl 1430.68122) Full Text: DOI arXiv
Fiala, Jiří; Hubička, Jan; Long, Yangjing Universality of intervals of line graph order. (English) Zbl 1300.05269 Eur. J. Comb. 41, 221-231 (2014). MSC: 05C76 05C07 05C35 PDFBibTeX XMLCite \textit{J. Fiala} et al., Eur. J. Comb. 41, 221--231 (2014; Zbl 1300.05269) Full Text: DOI arXiv
Fiala, Jiří; Kamiński, Marcin; Lidický, Bernard; Paulusma, Daniël The \(k\)-in-a-path problem for claw-free graphs. (English) Zbl 1236.68088 Algorithmica 62, No. 1-2, 499-519 (2012). MSC: 68Q17 05C85 PDFBibTeX XMLCite \textit{J. Fiala} et al., Algorithmica 62, No. 1--2, 499--519 (2012; Zbl 1236.68088) Full Text: DOI
Fiala, Jiří; Kratochvíl, Jan Locally constrained graph homomorphisms – structure, complexity, and applications. (English) Zbl 1302.05122 Comput. Sci. Rev. 2, No. 2, 97-111 (2008). MSC: 05C60 05C15 05C70 05C85 68R10 05-02 PDFBibTeX XMLCite \textit{J. Fiala} and \textit{J. Kratochvíl}, Comput. Sci. Rev. 2, No. 2, 97--111 (2008; Zbl 1302.05122) Full Text: DOI Backlinks: MO
Fiala, Jiří; Paulusma, Daniël Comparing universal covers in polynomial time. (English) Zbl 1142.68456 Hirsch, Edward A. (ed.) et al., Computer science – theory and applications. Third international computer science symposium in Russia, CSR 2008 Moscow, Russia, June 7–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79708-1/pbk). Lecture Notes in Computer Science 5010, 158-167 (2008). MSC: 68R10 05C70 05C85 90C59 PDFBibTeX XMLCite \textit{J. Fiala} and \textit{D. Paulusma}, Lect. Notes Comput. Sci. 5010, 158--167 (2008; Zbl 1142.68456) Full Text: DOI Link
Fiala, Jiří; Paulusma, Daniël; Telle, Jan Arne Locally constrained graph homomorphisms and equitable partitions. (English) Zbl 1205.05141 Eur. J. Comb. 29, No. 4, 850-880 (2008). MSC: 05C50 05C07 05C60 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{J. Fiala} et al., Eur. J. Comb. 29, No. 4, 850--880 (2008; Zbl 1205.05141) Full Text: DOI Link
Fiala, Jiří; Kratochvíl, Jan; Pór, Attila On the computational complexity of partial covers of theta graphs. (English) Zbl 1138.05061 Discrete Appl. Math. 156, No. 7, 1143-1149 (2008). MSC: 05C75 PDFBibTeX XMLCite \textit{J. Fiala} et al., Discrete Appl. Math. 156, No. 7, 1143--1149 (2008; Zbl 1138.05061) Full Text: DOI