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
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.; Bessy, S.; Gonçalves, D.; Picasarri-Arrieta, L. Complexity of some arc-partition problems for digraphs. (English) Zbl 07597584 Theor. Comput. Sci. 928, 167-182 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 928, 167--182 (2022; Zbl 07597584) Full Text: DOI
Bang-Jensen, Jørgen; Schweser, Thomas; Stiebitz, Michael Digraphs and variable degeneracy. (English) Zbl 1484.05081 SIAM J. Discrete Math. 36, No. 1, 578-595 (2022). MSC: 05C20 05C15 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., SIAM J. Discrete Math. 36, No. 1, 578--595 (2022; Zbl 1484.05081) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Bessy, Stéphane; Huang, Jing; Kriesell, Matthias Good orientations of unions of edge-disjoint spanning trees. (English) Zbl 1521.05053 J. Graph Theory 96, No. 4, 594-618 (2021). MSC: 05C20 05B35 05C70 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 96, No. 4, 594--618 (2021; Zbl 1521.05053) Full Text: DOI
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; Bellitto, Thomas; Schweser, Thomas; Stiebitz, Michael On DP-coloring of digraphs. (English) Zbl 1486.05112 J. Graph Theory 95, No. 1, 76-98 (2020). MSC: 05C20 05C15 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 95, No. 1, 76--98 (2020; Zbl 1486.05112) Full Text: DOI
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ørgen; Bellitto, Thomas; Schweser, Thomas; Stiebitz, Michael Hajós and Ore constructions for digraphs. (English) Zbl 1435.05088 Electron. J. Comb. 27, No. 1, Research Paper P1.63, 22 p. (2020). MSC: 05C20 05C15 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Electron. J. Comb. 27, No. 1, Research Paper P1.63, 22 p. (2020; Zbl 1435.05088) Full Text: DOI arXiv Link
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
Bang-Jensen, J.; Knudsen, Kristine V. K.; Saurabh, Saket; Zehavi, Meirav The parameterized complexity landscape of finding 2-partitions of digraphs. (English) Zbl 1434.68205 Theor. Comput. Sci. 795, 108-114 (2019). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 795, 108--114 (2019; Zbl 1434.68205) Full Text: DOI
Bang-Jensen, Jørgen; Christiansen, Tilde My Degree constrained 2-partitions of semicomplete digraphs. (English) Zbl 1401.05129 Theor. Comput. Sci. 746, 112-123 (2018). MSC: 05C20 05C70 68Q25 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{T. M. Christiansen}, Theor. Comput. Sci. 746, 112--123 (2018; Zbl 1401.05129) Full Text: DOI
Bang-Jensen, Jørgen; Christiansen, Tilde My; Maddaloni, Alessandro Disjoint paths in decomposable digraphs. (English) Zbl 1365.05106 J. Graph Theory 85, No. 2, 545-567 (2017). MSC: 05C20 05C70 05C38 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 85, No. 2, 545--567 (2017; Zbl 1365.05106) Full Text: DOI
Bang-Jensen, Jørgen; Bessy, Stéphane; Jackson, Bill; Kriesell, Matthias Antistrong digraphs. (English) Zbl 1350.05048 J. Comb. Theory, Ser. B 122, 68-90 (2017). MSC: 05C20 05B35 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Comb. Theory, Ser. B 122, 68--90 (2017; Zbl 1350.05048) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Maddaloni, Alessandro; Saurabh, Saket Algorithms and kernels for Feedback Set problems in generalizations of tournaments. (English) Zbl 1350.68126 Algorithmica 76, No. 2, 320-343 (2016). MSC: 68Q25 05C20 05C85 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Algorithmica 76, No. 2, 320--343 (2016; Zbl 1350.68126) Full Text: DOI
Bang-Jensen, J.; Cohen, Nathann; Havet, Frédéric Finding good 2-partitions of digraphs. II. Enumerable properties. (English) Zbl 1345.68168 Theor. Comput. Sci. 640, 1-19 (2016). MSC: 68Q25 05C20 05C70 68Q17 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 640, 1--19 (2016; Zbl 1345.68168) Full Text: DOI
Bang-Jensen, J.; Havet, Frédéric Finding good 2-partitions of digraphs. I. Hereditary properties. (English) Zbl 1342.68150 Theor. Comput. Sci. 636, 85-94 (2016). MSC: 68Q25 05C20 05C70 68Q17 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{F. Havet}, Theor. Comput. Sci. 636, 85--94 (2016; Zbl 1342.68150) Full Text: DOI
Bang-Jensen, Jørgen; Maddaloni, Alessandro Sufficient conditions for a digraph to be supereulerian. (English) Zbl 1312.05060 J. Graph Theory 79, No. 1, 8-20 (2015). MSC: 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{A. Maddaloni}, J. Graph Theory 79, No. 1, 8--20 (2015; Zbl 1312.05060) Full Text: DOI
Bang-Jensen, Jørgen; Maddaloni, Alessandro Arc-disjoint paths in decomposable digraphs. (English) Zbl 1302.05063 J. Graph Theory 77, No. 2, 89-110 (2014). MSC: 05C20 05C31 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{A. Maddaloni}, J. Graph Theory 77, No. 2, 89--110 (2014; Zbl 1302.05063) Full Text: DOI
Bang-Jensen, Jørgen; Bessy, Stéphane (Arc-)disjoint flows in networks. (English) Zbl 1290.90080 Theor. Comput. Sci. 526, 28-40 (2014). MSC: 90C35 05C20 05C45 68Q17 68W05 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{S. Bessy}, Theor. Comput. Sci. 526, 28--40 (2014; Zbl 1290.90080) Full Text: DOI
Bang-Jensen, Jørgen; Simonsen, Sven Arc-disjoint paths and trees in 2-regular digraphs. (English) Zbl 1285.05075 Discrete Appl. Math. 161, No. 16-17, 2724-2730 (2013). MSC: 05C20 05C05 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{S. Simonsen}, Discrete Appl. Math. 161, No. 16--17, 2724--2730 (2013; Zbl 1285.05075) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Maddaloni, Alessandro; Simonsen, Sven Quasi-hamiltonian paths in semicomplete multipartite digraphs. (English) Zbl 1262.05095 Discrete Appl. Math. 161, No. 7-8, 889-898 (2013). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Appl. Math. 161, No. 7--8, 889--898 (2013; Zbl 1262.05095) Full Text: DOI
Bang-Jensen, Jørgen; Huang, Jing Decomposing locally semicomplete digraphs into strong spanning subdigraphs. (English) Zbl 1241.05039 J. Comb. Theory, Ser. B 102, No. 3, 701-714 (2012). MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{J. Huang}, J. Comb. Theory, Ser. B 102, No. 3, 701--714 (2012; Zbl 1241.05039) Full Text: DOI
Bang-Jensen, Jørgen; MacGillivray, Gary; Swarts, Jacobus The complexity of colouring by locally semicomplete digraphs. (English) Zbl 1221.05173 Discrete Math. 310, No. 20, 2675-2684 (2010). MSC: 05C20 05C15 05C60 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 310, No. 20, 2675--2684 (2010; Zbl 1221.05173) Full Text: DOI
Bang-Jensen, Jørgen; Jordán, Tibor Spanning 2-strong tournaments in 3-strong semicomplete digraphs. (English) Zbl 1221.05172 Discrete Math. 310, No. 9, 1424-1428 (2010). MSC: 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{T. Jordán}, Discrete Math. 310, No. 9, 1424--1428 (2010; Zbl 1221.05172) Full Text: DOI
Bang-Jensen, Jørgen \(k\)-strong spanning local tournaments in locally semicomplete digraphs. (English) Zbl 1211.05050 Discrete Appl. Math. 157, No. 11, 2536-2540 (2009). MSC: 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen}, Discrete Appl. Math. 157, No. 11, 2536--2540 (2009; Zbl 1211.05050) Full Text: DOI
Bang-Jensen, Jørgen; Nielsen, Morten Hegner Minimum cycle factors in quasi-transitive digraphs. (English) Zbl 1134.90045 Discrete Optim. 5, No. 1, 121-137 (2008). MSC: 90C35 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{M. H. Nielsen}, Discrete Optim. 5, No. 1, 121--137 (2008; Zbl 1134.90045) 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
Bang-Jensen, Jørgen; Nielsen, Morten Hegner Finding complementary cycles in locally semicomplete digraphs. (English) Zbl 1055.05086 Discrete Appl. Math. 146, No. 3, 245-256 (2005). MSC: 05C38 05C20 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{M. H. Nielsen}, Discrete Appl. Math. 146, No. 3, 245--256 (2005; Zbl 1055.05086) Full Text: DOI
Bang-Jensen, Jørgen The structure of strong arc-locally semicomplete digraphs. (English) Zbl 1048.05038 Discrete Math. 283, No. 1-3, 1-6 (2004). Reviewer: Gregory Gutin (Egham, Surrey) MSC: 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen}, Discrete Math. 283, No. 1--3, 1--6 (2004; Zbl 1048.05038) 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
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
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
Bang-Jensen, Jørgen; Gutin, Gregory On the complexity of hamiltonian path and cycle problems in certain classes of digraphs. (English) Zbl 0934.05082 Discrete Appl. Math. 95, No. 1-3, 41-60 (1999). Reviewer: C.-Q.Zhang (Morgantown) MSC: 05C45 05-02 05C38 05C20 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{G. Gutin}, Discrete Appl. Math. 95, No. 1--3, 41--60 (1999; Zbl 0934.05082) Full Text: DOI
Bang-Jensen, Jørgen; Huang, Jing Kings in quasi-transitive digraphs. (English) Zbl 0955.05048 Discrete Math. 185, No. 1-3, 19-27 (1998). MSC: 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{J. Huang}, Discrete Math. 185, No. 1--3, 19--27 (1998; Zbl 0955.05048) Full Text: DOI
Bang-Jensen, Jørgen; Jordán, Tibor Adding and reversing arcs in semicomplete digraphs. (English) Zbl 0892.05019 Comb. Probab. Comput. 7, No. 1, 17-25 (1998). Reviewer: D.P.Brown (Carbondale) MSC: 05C20 05C40 05C35 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{T. Jordán}, Comb. Probab. Comput. 7, No. 1, 17--25 (1998; Zbl 0892.05019) Full Text: DOI
Bang-Jensen, J.; El Haddad, M.; Manoussakis, Y.; Przytycka, T. M. Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs. (English) Zbl 0864.68049 Algorithmica 17, No. 1, 67-87 (1997). MSC: 68W15 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Algorithmica 17, No. 1, 67--87 (1997; Zbl 0864.68049) Full Text: DOI
Bang-Jensen, Jørgen; Gutin, Gregory Paths and cycles in extended and decomposable digraphs. (English) Zbl 0872.05028 Discrete Math. 164, No. 1-3, 5-19 (1997). Reviewer: W.-K.Chen (Chicago) MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{G. Gutin}, Discrete Math. 164, No. 1--3, 5--19 (1997; Zbl 0872.05028) Full Text: DOI
Bang-Jensen, Jørgen; Gutin, Gregory Vertex heaviest paths and cycles in quasi-transitive digraphs. (English) Zbl 0876.05058 Discrete Math. 163, No. 1-3, 217-223 (1997). Reviewer: A.Huck (Hannover) MSC: 05C38 05C20 05C45 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{G. Gutin}, Discrete Math. 163, No. 1--3, 217--223 (1997; Zbl 0876.05058) Full Text: DOI
Bang-Jensen, Jørgen; Gutin, Gregory; Li, Hao Sufficient conditions for a digraph to be hamiltonian. (English) Zbl 0854.05067 J. Graph Theory 22, No. 2, 181-187 (1996). Reviewer: R.Faudree (Memphis) MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 22, No. 2, 181--187 (1996; Zbl 0854.05067) Full Text: DOI
Bang-Jensen, Jørgen; Guo, Yubao; Volkmann, Lutz Weakly hamiltonian-connected locally semicomplete digraphs. (English) Zbl 0845.05047 J. Graph Theory 21, No. 2, 163-172 (1996). Reviewer: M.Hager (Leonberg) MSC: 05C20 05C75 05C45 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., J. Graph Theory 21, No. 2, 163--172 (1996; Zbl 0845.05047) Full Text: DOI
Bang-Jensen, Jørgen; Gutin, Gregory Paths, trees and cycles in tournaments. (English) Zbl 0894.05032 Congr. Numerantium 115, 131-170 (1996). Reviewer: N.F.Quimpo (Manila) MSC: 05C38 05C20 05C05 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{G. Gutin}, Congr. Numerantium 115, 131--170 (1996; Zbl 0894.05032)
Bang-Jensen, Jørgen; Gutin, Gregory; Huang, Jing A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. (English) Zbl 0870.05046 Discrete Math. 161, No. 1-3, 1-12 (1996). MSC: 05C45 05C20 05C38 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 161, No. 1--3, 1--12 (1996; Zbl 0870.05046) Full Text: DOI
Bang-Jensen, Jørgen Digraphs with the path-merging property. (English) Zbl 0832.05047 J. Graph Theory 20, No. 2, 255-265 (1995). Reviewer: G.Gutin (Odense) MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{J. Bang-Jensen}, J. Graph Theory 20, No. 2, 255--265 (1995; Zbl 0832.05047) Full Text: DOI
Bang-Jensen, Jørgen; Huang, Jing Quasi-transitive digraphs. (English) Zbl 0832.05048 J. Graph Theory 20, No. 2, 141-161 (1995). Reviewer: G.Gutin (Odense) MSC: 05C20 05C38 05C45 05C75 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{J. Huang}, J. Graph Theory 20, No. 2, 141--161 (1995; Zbl 0832.05048) Full Text: DOI
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary Hereditarily hard \(H\)-colouring problems. (English) Zbl 0816.68090 Discrete Math. 138, No. 1-3, 75-92 (1995). MSC: 68R10 68Q25 05C15 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 138, No. 1--3, 75--92 (1995; Zbl 0816.68090) Full Text: DOI
Bang-Jensen, Jørgen; Hell, Pavol; Huang, Jing Optimal recognition of local tournaments. (English) Zbl 0836.05035 Congr. Numerantium 100, 141-146 (1994). MSC: 05C20 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Congr. Numerantium 100, 141--146 (1994; Zbl 0836.05035)
Bang-Jensen, Jørgen; MacGillivray, Gary On the complexity of colouring by digraphs with at most one directed cycle. (English) Zbl 0840.05022 Ars Comb. 35A, 175-186 (1993). MSC: 05C15 05C20 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{G. MacGillivray}, Ars Comb. 35 A, 175--186 (1993; Zbl 0840.05022)
Bang-Jensen, Jørgen; Hell, Pavol Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs. (English) Zbl 0770.05049 Discrete Appl. Math. 41, No. 1, 75-79 (1993). Reviewer: Liu Zhenhong (Beijing) MSC: 05C20 05C38 05C85 05C45 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{P. Hell}, Discrete Appl. Math. 41, No. 1, 75--79 (1993; Zbl 0770.05049) Full Text: DOI
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary On the complexity of colouring by superdigraphs of bipartite graphs. (English) Zbl 0783.05047 Discrete Math. 109, No. 1-3, 27-44 (1992). MSC: 05C15 68Q25 05C20 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 109, No. 1--3, 27--44 (1992; Zbl 0783.05047) Full Text: DOI
Bang-Jensen, Jørgen Locally semicomplete digraphs: A generalization of tournaments. (English) Zbl 0703.05026 J. Graph Theory 14, No. 3, 371-390 (1990). Reviewer: J.W.Moon MSC: 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen}, J. Graph Theory 14, No. 3, 371--390 (1990; Zbl 0703.05026) Full Text: DOI
Bang-Jensen, Jørgen On the 2-linkage problem for semicomplete digraphs. (English) Zbl 0664.05034 Graph theory in memory of G. A. Dirac, Pap. Meet., Sandbjerg/Den. 1985, Ann. Discrete Math. 41, 23-37 (1989). Reviewer: Ki Hang Kim MSC: 05C38 05C20 PDFBibTeX XML