Bang-Jensen, Jørgen; Johansen, Kasper S.; Yeo, Anders Making a tournament \(k\)-strong. (English) Zbl 1522.05243 J. Graph Theory 103, No. 1, 5-11 (2023). MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 103, No. 1, 5--11 (2023; Zbl 1522.05243) Full Text: DOI OA License
Bang-Jensen, Jørgen; Havet, Frédéric; Yeo, Anders Spanning Eulerian subdigraphs in semicomplete digraphs. (English) Zbl 1522.05155 J. Graph Theory 102, No. 3, 578-606 (2023). MSC: 05C20 05C85 05C40 05C45 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 102, No. 3, 578--606 (2023; Zbl 1522.05155) Full Text: DOI arXiv OA License
Sun, Yuefang; Yeo, Anders Directed Steiner tree packing and directed tree connectivity. (English) Zbl 1522.05041 J. Graph Theory 102, No. 1, 86-106 (2023). MSC: 05C05 05C20 05C40 05C45 05C70 05C75 05C85 68Q25 PDFBibTeX XMLCite \textit{Y. Sun} and \textit{A. Yeo}, J. Graph Theory 102, No. 1, 86--106 (2023; Zbl 1522.05041) Full Text: DOI arXiv
Bang-Jensen, J.; Havet, F.; Kriesell, M.; Yeo, A. Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. (English) Zbl 1522.05091 J. Graph Theory 99, No. 4, 615-636 (2022). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 99, No. 4, 615--636 (2022; Zbl 1522.05091) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Bellitto, Thomas; Yeo, Anders Proper-walk connection number of graphs. (English) Zbl 1521.05087 J. Graph Theory 96, No. 1, 137-159 (2021). MSC: 05C40 05C85 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 96, No. 1, 137--159 (2021; Zbl 1521.05087) Full Text: DOI
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders Arc-disjoint strong spanning subdigraphs of semicomplete compositions. (English) Zbl 1486.05239 J. Graph Theory 95, No. 2, 267-289 (2020). MSC: 05C70 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 95, No. 2, 267--289 (2020; Zbl 1486.05239) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Déprés, Hugues; Yeo, Anders Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments. (English) Zbl 1448.05083 Discrete Math. 343, No. 12, Article ID 112129, 7 p. (2020). MSC: 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 343, No. 12, Article ID 112129, 7 p. (2020; Zbl 1448.05083) Full Text: DOI arXiv
Bang-Jensen, J.; Bellitto, T.; Lochet, W.; Yeo, A. The directed 2-linkage problem with length constraints. (English) Zbl 1445.68146 Theor. Comput. Sci. 814, 69-73 (2020). Reviewer: K. Subramani (Morgantown) MSC: 68R10 05C20 05C38 68Q25 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 814, 69--73 (2020; Zbl 1445.68146) Full Text: DOI arXiv Link
Adamus, Janusz; Adamus, Lech; Yeo, Anders On the Meyniel condition for Hamiltonicity in bipartite digraphs. (English) Zbl 1294.05081 Discrete Math. Theor. Comput. Sci. 16, No. 1, 293-302 (2014). MSC: 05C20 05C45 05C38 PDFBibTeX XMLCite \textit{J. Adamus} et al., Discrete Math. Theor. Comput. Sci. 16, No. 1, 293--302 (2014; Zbl 1294.05081) Full Text: arXiv Link
Gutin, G.; Johnstone, A.; Reddington, J.; Scott, E.; Yeo, A. An algorithm for finding input-output constrained convex sets in an acyclic digraph. (English) Zbl 1248.05078 J. Discrete Algorithms 13, 47-58 (2012). MSC: 05C20 52A15 68M99 68R10 PDFBibTeX XMLCite \textit{G. Gutin} et al., J. Discrete Algorithms 13, 47--58 (2012; Zbl 1248.05078) Full Text: DOI
Daligault, Jean; Gutin, Gregory; Kim, Eun Jung; Yeo, Anders FPT algorithms and kernels for the directed \(k\)-leaf problem. (English) Zbl 1184.05120 J. Comput. Syst. Sci. 76, No. 2, 144-152 (2010). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{J. Daligault} et al., J. Comput. Syst. Sci. 76, No. 2, 144--152 (2010; Zbl 1184.05120) Full Text: DOI
Gutin, Gregory; Rafiey, Arash; Yeo, Anders Minimum cost homomorphism dichotomy for oriented cycles. (English) Zbl 1188.05073 Graphs Comb. 25, No. 4, 521-531 (2009). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 PDFBibTeX XMLCite \textit{G. Gutin} et al., Graphs Comb. 25, No. 4, 521--531 (2009; Zbl 1188.05073) Full Text: DOI
Havet, Frédéric; Thomassé, Stéphan; Yeo, Anders Hoàng-Reed conjecture holds for tournaments. (English) Zbl 1147.05038 Discrete Math. 308, No. 15, 3412-3415 (2008). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{F. Havet} et al., Discrete Math. 308, No. 15, 3412--3415 (2008; Zbl 1147.05038) Full Text: DOI
Bang-Jensen, Jørgen; Nielsen, Morten Hegner; Yeo, Anders Longest path partitions in generalizations of tournaments. (English) Zbl 1103.05036 Discrete Math. 306, No. 16, 1830-1839 (2006). Reviewer: Norman F. Quimpo (Manila) MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 306, No. 16, 1830--1839 (2006; Zbl 1103.05036) Full Text: DOI
Gutin, Gregory; Rafiey, Arash; Yeo, Anders Minimum cost and list homomorphisms to semicomplete digraphs. (English) Zbl 1138.05032 Discrete Appl. Math. 154, No. 6, 890-897 (2006). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 05C15 PDFBibTeX XMLCite \textit{G. Gutin} et al., Discrete Appl. Math. 154, No. 6, 890--897 (2006; Zbl 1138.05032) Full Text: DOI
Bang-Jensen, Jørgen; Yeo, Anders Making a tournament \(k\)-arc-strong by reversing or deorienting arcs. (English) Zbl 1035.05045 Discrete Appl. Math. 136, No. 2-3, 161-171 (2004). MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{A. Yeo}, Discrete Appl. Math. 136, No. 2--3, 161--171 (2004; Zbl 1035.05045) Full Text: DOI
Bang-Jensen, Jørgen; Huang, Jing; Yeo, Anders Strongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphs. (English) Zbl 1029.05063 SIAM J. Discrete Math. 16, No. 2, 335-343 (2003). MSC: 05C20 05C38 05C40 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., SIAM J. Discrete Math. 16, No. 2, 335--343 (2003; Zbl 1029.05063) Full Text: DOI
Bang-Jensen, Jørgen; Thomassé, Stéphan; Yeo, Anders Small degree out-branchings. (English) Zbl 1018.05041 J. Graph Theory 42, No. 4, 297-307 (2003). Reviewer: Gregory Gutin (Egham) MSC: 05C20 05C05 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 42, No. 4, 297--307 (2003; Zbl 1018.05041) Full Text: DOI
Gutin, Gregory; Koh, Khee Meng; Tay, Eng Guan; Yeo, Anders Almost minimum diameter orientations of semicomplete multipartite and extended digraphs. (English) Zbl 1012.05078 Graphs Comb. 18, No. 3, 499-506 (2002). Reviewer: Ján Plesník (Bratislava) MSC: 05C20 05C12 PDFBibTeX XMLCite \textit{G. Gutin} et al., Graphs Comb. 18, No. 3, 499--506 (2002; Zbl 1012.05078) Full Text: DOI
Tewes, Meike; Volkmann, Lutz; Yeo, Anders Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic. (English) Zbl 0993.05083 Discrete Math. 242, No. 1-3, 201-228 (2002). Reviewer: Gregory Gutin (Egham) MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{M. Tewes} et al., Discrete Math. 242, No. 1--3, 201--228 (2002; Zbl 0993.05083) Full Text: DOI
Bang-Jensen, Jørgen; Yeo, Anders Making a tournament \(k\)-arc-strong by reversing arcs. (English) Zbl 1409.05093 Broersma, Hajo (ed.) et al., Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6–8, 2001. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 8, 2-5 (2001). MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{A. Yeo}, Electron. Notes Discrete Math. 8, 2--5 (2001; Zbl 1409.05093) Full Text: Link
Gutin, Gregory; Tewes, Meike; Yeo, Anders Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. (English) Zbl 0962.05032 Discrete Math. 222, No. 1-3, 269-274 (2000). Reviewer: Lutz Volkmann (Aachen) MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{G. Gutin} et al., Discrete Math. 222, No. 1--3, 269--274 (2000; Zbl 0962.05032) Full Text: DOI
Guo, Yubao; Tewes, Meike; Volkmann, Lutz; Yeo, Anders Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. (English) Zbl 0943.05040 Discrete Math. 212, No. 1-2, 91-100 (2000). Reviewer: G.Gutin (Odense) MSC: 05C20 05C45 PDFBibTeX XMLCite \textit{Y. Guo} et al., Discrete Math. 212, No. 1--2, 91--100 (2000; Zbl 0943.05040) Full Text: DOI
Yeo, Anders A polynomial time algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph. (English) Zbl 0946.68105 J. Algorithms 33, No. 1, 124-139 (1999). MSC: 68R10 68N01 05C70 05C85 PDFBibTeX XMLCite \textit{A. Yeo}, J. Algorithms 33, No. 1, 124--139 (1999; Zbl 0946.68105) Full Text: DOI Link
Yeo, Anders How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? (English) Zbl 0939.05059 Graphs Comb. 15, No. 4, 481-493 (1999). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{A. Yeo}, Graphs Comb. 15, No. 4, 481--493 (1999; Zbl 0939.05059) Full Text: DOI
Bang-Jensen, Jørgen; Guo, Yubao; Yeo, Anders A new sufficient condition for a digraph to be Hamiltonian. (English) Zbl 0933.05095 Discrete Appl. Math. 95, No. 1-3, 61-72 (1999). Reviewer: G.Gutin (Odense) MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Appl. Math. 95, No. 1--3, 61--72 (1999; Zbl 0933.05095) Full Text: DOI
Gutin, Gregory; Sudakov, Benjamin; Yeo, Anders Note on alternating directed cycles. (English) Zbl 0956.05060 Discrete Math. 191, No. 1-3, 101-107 (1998). MSC: 05C38 05C20 05C85 PDFBibTeX XMLCite \textit{G. Gutin} et al., Discrete Math. 191, No. 1--3, 101--107 (1998; Zbl 0956.05060) Full Text: DOI
Yeo, Anders One-diregular subgraphs in semicomplete multipartite digraphs. (English) Zbl 0865.05045 J. Graph Theory 24, No. 2, 175-185 (1997). Reviewer: G.Gutin (Odense) MSC: 05C20 05C45 05C70 05C15 PDFBibTeX XMLCite \textit{A. Yeo}, J. Graph Theory 24, No. 2, 175--185 (1997; Zbl 0865.05045) Full Text: DOI
Gutin, Gregory; Yeo, Anders Ranking the vertices of a complete multipartite paired comparison digraph. (English) Zbl 0868.68083 Discrete Appl. Math. 69, No. 1-2, 75-82 (1996). MSC: 68R10 05C20 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{A. Yeo}, Discrete Appl. Math. 69, No. 1--2, 75--82 (1996; Zbl 0868.68083) Full Text: DOI Link