Jørgen Bang-Jensen

发表

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs

Jørgen Bang-Jensen, J. Bang-Jensen, 2009, Discret. Math..

Digraphs - theory, algorithms and applications

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 2002 .

Longest path partitions in generalizations of tournaments

Jørgen Bang-Jensen, Anders Yeo, Morten Hegner Nielsen, 2006, Discret. Math..

On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1999, Discret. Appl. Math..

Recognizing and representing proper interval graphs in parallel using merging and sorting

Louis Ibarra, Jørgen Bang-Jensen, Jing Huang, 2007, Discret. Appl. Math..

Orientations of Graphs

Jørgen Bang-Jensen, Gregory Gutin, 2002 .

A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation

Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling, 2010, Networks.

Finding complementary cycles in locally semicomplete digraphs

Jørgen Bang-Jensen, Morten Hegner Nielsen, M. Nielsen, 2005, Discret. Appl. Math..

Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

András Frank, Bill Jackson, Jørgen Bang-Jensen, 1995, SIAM J. Discret. Math..

Connectivity of Digraphs

Jørgen Bang-Jensen, Gregory Gutin, 2009 .

Problems concerning global connectivity of directed graphs

Jørgen Bang-Jensen, J. Bang-Jensen, 2000, Electron. Notes Discret. Math..

Hereditarily hard H-colouring problems

Gary MacGillivray, Jørgen Bang-Jensen, Pavol Hell, 1995, Discret. Math..

Decomposing k-ARc-Strong Tournaments Into Strong Spanning Subdigraphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2004, Comb..

Augmenting hypergraphs by edges of size two

Jørgen Bang-Jensen, Bill Jackson, 1999, Math. Program..

In-Tournament Digraphs

Jørgen Bang-Jensen, Erich Prisner, Jing Huang, 1993, J. Comb. Theory, Ser. B.

Out-colourings of Digraphs

Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy, 2020, J. Graph Theory.

Locally Semicomplete Digraphs and Generalizations

Jørgen Bang-Jensen, J. Bang-Jensen, 2018, Classes of Directed Graphs.

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1998, J. Graph Theory.

Edge-Connectivity Augmentation Preserving Simplicity

Tibor Jordán, Jørgen Bang-Jensen, 1998, SIAM J. Discret. Math..

Algorithms and Their Complexity

Gregory Gutin, Jørgen Bang-Jensen, 2009 .

A New Sufficient Condition for a Digraph to Be Hamiltonian

Jørgen Bang-Jensen, Anders Yeo, Yubao Guo, 1999, Discret. Appl. Math..

Arc-disjoint spanning sub(di)graphs in digraphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2012, Theor. Comput. Sci..

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1997, Combinatorics, Probability and Computing.

Disjoint Paths in Decomposable Digraphs

Jørgen Bang-Jensen, Tilde My Christiansen, Alessandro Maddaloni, 2017, J. Graph Theory.

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2006, Discret. Optim..

A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles

Gary MacGillivray, Jørgen Bang-Jensen, Jacobus Swarts, 2011, Contributions Discret. Math..

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs

Inge Li Gørtz, Jørgen Bang-Jensen, Daniel Gonçalves, 2007, Discret. Optim..

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1998, Discret. Appl. Math..

Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties

Jørgen Bang-Jensen, Anders Yeo, Daniel Gonçalves, 2013, Theor. Comput. Sci..

$χ$-bounded Families of Oriented Graphs pdf

Jørgen Bang-Jensen, Nicolas Bousquet, José Zamora, 2018, J. Graph Theory.

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments

Yannis Manoussakis, Jørgen Bang-Jensen, Y. Manoussakis, 1995, J. Comb. Theory, Ser. B.

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments

Saket Saurabh, Jørgen Bang-Jensen, Alessandro Maddaloni, 2015, Algorithmica.

(Arc-)disjoint flows in networks

Jørgen Bang-Jensen, Stéphane Bessy, S. Bessy, 2014, Theor. Comput. Sci..

Splitting off edges between two subsets preserving the edge-connectivity of the graph

Tibor Jordán, Jørgen Bang-Jensen, 2004, Discret. Math..

Locally semicomplete digraphs: A generalization of tournaments

Jørgen Bang-Jensen, J. Bang-Jensen, 1990, J. Graph Theory.

Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph

Tibor Jordán, Jørgen Bang-Jensen, Tibor Jordán, 2000, J. Algorithms.

Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions pdf

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2020, J. Graph Theory.

Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments

Jørgen Bang-Jensen, Stéphan Thomassé, Stéphane Bessy, 2014, J. Graph Theory.

Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs

Jørgen Bang-Jensen, Pavol Hell, P. Hell, 1993, Discret. Appl. Math..

Alternating cycles and paths in edge-coloured multigraphs: A survey

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1994, Discret. Math..

Arc-disjoint paths and trees in 2-regular digraphs

Jørgen Bang-Jensen, Sven Simonsen, J. Bang-Jensen, 2012, Discret. Appl. Math..

On chordal proper circular arc graphs

Jørgen Bang-Jensen, Pavol Hell, 1994, Discret. Math..

Safe sets in digraphs pdf

Jørgen Bang-Jensen, Anders Yeo, Shinya Fujita, 2019, ArXiv.

Adding and Reversing Arcs in Semicomplete Digraphs

Tibor Jordán, Jørgen Bang-Jensen, J. Bang-Jensen, 1998, Combinatorics, Probability and Computing.

Vertex coloring edge-weighted digraphs

Jørgen Bang-Jensen, Magnús M. Halldórsson, M. Halldórsson, 2015, Inf. Process. Lett..

K-strong Spanning Local Tournaments in Locally Semicomplete Digraphs

Jørgen Bang-Jensen, J. Bang-Jensen, 2009, Discret. Appl. Math..

Eulerian trails through a set of terminals in specific, unique and all orders

Jørgen Bang-Jensen, Svatopluk Poljak, S. Poljak, 1991, Graph Structure Theory.

When the greedy algorithm fails

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2004, Discret. Optim..

Quasi-transitive digraphs

Jørgen Bang-Jensen, Jing Huang, Jing Huang, 1995, J. Graph Theory.

DAG-Width and Circumference of Digraphs

Jørgen Bang-Jensen, Tilde My Larsen, 2016, J. Graph Theory.

Subgraphs in vertex neighborhoods of Kr-free graphs

Jørgen Bang-Jensen, Stephan Brandt, 2004, J. Graph Theory.

Digraphs - Theory, Algorithms and Applications, Second Edition

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 2009, Springer Monographs in Mathematics.

The Complexity of Colouring by Semicomplete Digraphs

Gary MacGillivray, Jørgen Bang-Jensen, Pavol Hell, 1988, SIAM J. Discret. Math..

Completing orientations of partially oriented graphs

Xuding Zhu, Jørgen Bang-Jensen, Jing Huang, 2015, J. Graph Theory.

Restricted cycle factors and arc-decompositions of digraphs

Jørgen Bang-Jensen, Carl Johan Casselgren, C. J. Casselgren, 2015, Discret. Appl. Math..

Weakly Hamiltonian-connected locally semicomplete digraphs

Lutz Volkmann, Jørgen Bang-Jensen, Yubao Guo, 1996, J. Graph Theory.

Spanning 2-strong tournaments in 3-strong semicomplete digraphs

Tibor Jordán, Jørgen Bang-Jensen, J. Bang-Jensen, 2010, Discret. Math..

Optimization methods for real-life scheduling problems

Jørgen Bang-Jensen, Rune Larsen, J. Bang-Jensen, 2012 .

Kings in quasi-transitive digraphs

Jørgen Bang-Jensen, Jing Huang, Jing Huang, 1998, Discret. Math..

Convex-Round and Concave-Round Graphs

Jørgen Bang-Jensen, Anders Yeo, Jing Huang, 2000, SIAM J. Discret. Math..

Quasi-hamiltonian paths in semicomplete multipartite digraphs

Jørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen, 2013, Discret. Appl. Math..

Edge-connectivity augmentation with partition constraints

Tibor Jordán, Jørgen Bang-Jensen, Zoltán Szigeti, 1998, SODA '98.

Finding good 2-partitions of digraphs II. Enumerable properties

Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet, 2016, Theor. Comput. Sci..

Vertex-disjoint directed and undirected cycles in general digraphs

Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, 2011, J. Comb. Theory, Ser. B.

Connecting edge-colouring pdf

Jørgen Bang-Jensen, Anders Yeo, Thomas Bellitto, 2019, ArXiv.

Balanced branchings in digraphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2015, Theor. Comput. Sci..

Basic Terminology, Notation and Results

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 2018, Classes of Directed Graphs.

Making a tournament k-arc-strong by reversing or deorienting arcs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2004, Discret. Appl. Math..

Efficient algorithms for real-life instances of the variable size bin packing problem

Jørgen Bang-Jensen, Rune Larsen, 2012, Comput. Oper. Res..

Sufficient Conditions for a Digraph to be Supereulerian

Jørgen Bang-Jensen, Alessandro Maddaloni, J. Bang-Jensen, 2015, J. Graph Theory.

Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments

Jørgen Bang-Jensen, Anders Yeo, Jing Huang, 2004, J. Graph Theory.

Making a tournament k-arc-strong by reversing arcs

Jørgen Bang-Jensen, Anders Yeo, 2001, Electron. Notes Discret. Math..

On the complexity of colouring by superdigraphs of bipartite graphs

Gary MacGillivray, Jørgen Bang-Jensen, Pavol Hell, 1992, Discret. Math..

On k-strong and k-cyclic digraphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1996, Discret. Math..

Finding good 2-partitions of digraphs I. Hereditary properties

Jørgen Bang-Jensen, Frédéric Havet, F. Havet, 2016, Theor. Comput. Sci..

Paths and cycles in extended and decomposable digraphs,

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1997, Discret. Math..

Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles

Jørgen Bang-Jensen, Stéphane Bessy, S. Bessy, 2015, J. Graph Theory.

Degree-constrained 2-partitions of graphs

Jørgen Bang-Jensen, Stéphane Bessy, S. Bessy, 2018, Theor. Comput. Sci..

The structure of strong arc-locally semicomplete digraphs

Jørgen Bang-Jensen, J. Bang-Jensen, 2004, Discret. Math..

Parallel algorithms for the hamiltonian cycle and hamiltonian path problems in semicomplete bipartite digraphs

Yannis Manoussakis, Jørgen Bang-Jensen, Teresa M. Przytycka, 2006, Algorithmica.

Local Tournaments and Proper Circular Arc Gaphs

Jørgen Bang-Jensen, Pavol Hell, Jing Huang, 1990, SIGAL International Symposium on Algorithms.

Antistrong digraphs

Jørgen Bang-Jensen, Bill Jackson, Matthias Kriesell, 2017, J. Comb. Theory, Ser. B.

Degree constrained 2-partitions of semicomplete digraphs

Jørgen Bang-Jensen, Tilde My Christiansen, J. Bang-Jensen, 2018, Theor. Comput. Sci..

Complementary cycles containing prescribed vertices in tournaments

Jørgen Bang-Jensen, Anders Yeo, Yubao Guo, 2000, Discret. Math..

Vertex heaviest paths and cycles in quasi-transitive digraphs

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1997, Discret. Math..

Finding a subdivision of a digraph

Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia, 2015, Theor. Comput. Sci..

Spanning eulerian subdigraphs in semicomplete digraphs pdf

Jørgen Bang-Jensen, Anders Yeo, Frédéric Havet, 2019, ArXiv.

Edge-connectivity augmentation preserving simplicity

Tibor Jordán, Jørgen Bang-Jensen, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

On the structure of locally semicomplete digraphs

Jørgen Bang-Jensen, J. Bang-Jensen, 1992, Discret. Math..

Digrap: Theory and Algorithms

Jørgen Bang-Jensen, 2002 .

Component Order Connectivity in Directed Graphs pdf

Gregory Gutin, Magnus Wahlström, Jørgen Bang-Jensen, 2020, IPEC.

The effect of two cycles on the complexity of colourings by directed graphs

Jørgen Bang-Jensen, Pavol Hell, P. Hell, 1989, Discret. Appl. Math..

Sparse Subdigraphs with Prescribed Connectivity

Jørgen Bang-Jensen, Gregory Gutin, 2009 .

Orientations of Graphs and Digraphs

Jørgen Bang-Jensen, Gregory Gutin, 2009 .

Arc‐Disjoint In‐ and Out‐Branchings With the Same Root in Locally Semicomplete Digraphs

Jørgen Bang-Jensen, Jing Huang, Jing Huang, 2014, J. Graph Theory.

Flows in Networks

Jørgen Bang-Jensen, Gregory Gutin, 2009 .

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs

Saket Saurabh, Jørgen Bang-Jensen, Sven Simonsen, 2015, Algorithmica.

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs

Carsten Thomassen, Jørgen Bang-Jensen, C. Thomassen, 1992, SIAM J. Discret. Math..

Bipartite spanning sub(di)graphs induced by 2-partitions pdf

Jørgen Bang-Jensen, Anders Yeo, Frédéric Havet, 2019, J. Graph Theory.

Cycles throughk vertices in bipartite tournaments

Yannis Manoussakis, Jørgen Bang-Jensen, 1994, Comb..

Decomposing locally semicomplete digraphs into strong spanning subdigraphs

Jørgen Bang-Jensen, Jing Huang, Jing Huang, 2012, J. Comb. Theory, Ser. B.

The parameterized complexity landscape of finding 2-partitions of digraphs

Saket Saurabh, Jørgen Bang-Jensen, Meirav Zehavi, 2019, Theor. Comput. Sci..

Arc‐Disjoint Directed and Undirected Cycles in Digraphs

Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, 2016, J. Graph Theory.

Edge-disjoint in- and out-branchings in tournaments and related path problems

Jørgen Bang-Jensen, J. Bang-Jensen, 1991, J. Comb. Theory, Ser. B.

Heuristics for the central tree problem

Jørgen Bang-Jensen, Yury Nikulin, Y. Nikulin, 2010, J. Heuristics.

On the problem of finding disjoint cycles and dicycles in a digraph

Jørgen Bang-Jensen, Matthias Kriesell, 2011, Comb..

Linkages in locally semicomplete digraphs and quasi-transitive digraphs

Jørgen Bang-Jensen, J. Bang-Jensen, 1999, Discret. Math..

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs

Jørgen Bang-Jensen, Anders Yeo, Jing Huang, 2003, SIAM J. Discret. Math..

Tournaments and Semicomplete Digraphs

Jørgen Bang-Jensen, Frédéric Havet, F. Havet, 2018, Classes of Directed Graphs.

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2001, J. Algorithms.

Minimum cycle factors in quasi-transitive digraphs

Jørgen Bang-Jensen, Morten Hegner Nielsen, M. Nielsen, 2008, Discret. Optim..

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

Gregory Gutin, Jørgen Bang-Jensen, Jing Huang, 1993, Discret. Math..

Disjoint directed and undirected paths and cycles in digraphs

Jørgen Bang-Jensen, Matthias Kriesell, M. Kriesell, 2009, Theor. Comput. Sci..

Out-degree reducing partitions of digraphs

Jørgen Bang-Jensen, Anders Yeo, Frédéric Havet, 2018, Theor. Comput. Sci..

Small Degree Out-branchings

Jørgen Bang-Jensen, Anders Yeo, Stéphan Thomassé, 2001 .

Arc‐Disjoint Paths in Decomposable Digraphs

Jørgen Bang-Jensen, Alessandro Maddaloni, J. Bang-Jensen, 2014, J. Graph Theory.

Convex‐round graphs are circular‐perfect

Jørgen Bang-Jensen, Jing Huang, Jing Huang, 2002, J. Graph Theory.

Digraphs with the path-merging property

Jørgen Bang-Jensen, J. Bang-Jensen, 1995, J. Graph Theory.

On persistent directed graphs

Tibor Jordán, Jørgen Bang-Jensen, J. Bang-Jensen, 2008, Networks.

Disjoint sub(di)graphs in digraphs

Jørgen Bang-Jensen, Matthias Kriesell, M. Kriesell, 2009, Electron. Notes Discret. Math..

Mixed Models for the Analysis of Local Search Components

Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, 2007, SLS.

Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs

Jørgen Bang-Jensen, Stéphan Thomassé, Stéphan Thomassé, 2003, Discret. Appl. Math..

The complexity of finding arc-disjoint branching flows

Jørgen Bang-Jensen, Anders Yeo, Frédéric Havet, 2016, Discret. Appl. Math..

The complexity of multicut and mixed multicut problems in (di)graphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2014, Theor. Comput. Sci..

Parameterized Algorithms for Survivable Network Design with Uniform Demands

Saket Saurabh, Jørgen Bang-Jensen, Manu Basavaraju, 2018, SODA.

Generalizations of tournaments: A survey

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1998, J. Graph Theory.

The complexity of colouring by locally semicomplete digraphs

Gary MacGillivray, Jørgen Bang-Jensen, Jacobus Swarts, 2010, Discret. Math..

Alternating cycles and trails in 2-edge-coloured complete multigraphs

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 1998, Discret. Math..

Unsolved problems presented at the Julius Petersen Graph Theory Conference

Jørgen Bang-Jensen, Bjarne Toft, 1992, Discret. Math..

Cycle Structure of Digraphs

Jørgen Bang-Jensen, Gregory Gutin, 2002 .

The minimum spanning strong subdigraph problem is fixed parameter tractable

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2008, Discret. Appl. Math..

Weakly Hamiltonian-connected ordinary multipartite tournaments

Gregory Gutin, Jørgen Bang-Jensen, Jing Huang, 1995, Discret. Math..

A classification of locally semicomplete digraphs

Gregory Gutin, Lutz Volkmann, Jørgen Bang-Jensen, 1997, Discret. Math..

Steiner type problems for digraphs that are locally semicomplete or extended semicomplete

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2003, J. Graph Theory.

A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs

Yannis Manoussakis, Carsten Thomassen, Jørgen Bang-Jensen, 1992, J. Algorithms.

Finding an induced subdivision of a digraph

Jørgen Bang-Jensen, Nicolas Trotignon, Frédéric Havet, 2011, Electron. Notes Discret. Math..

The directed 2-linkage problem with length constraints

Jørgen Bang-Jensen, Anders Yeo, Thomas Bellitto, 2019, Theor. Comput. Sci..

A note on vertex pancyclic oriented graphs

Jørgen Bang-Jensen, Yubao Guo, Yubao Guo, 1997, J. Graph Theory.

Hajós and Ore Constructions for Digraphs

Michael Stiebitz, Jørgen Bang-Jensen, Thomas Bellitto, 2019, Electron. J. Comb..

Finding an induced subdivision of a digraph pdf

Jørgen Bang-Jensen, Nicolas Trotignon, Frédéric Havet, 2011, Electron. Notes Discret. Math..

Applications of Digraphs and Edge-Coloured Graphs

Jørgen Bang-Jensen, Gregory Gutin, 2009 .

k-Distinct Branchings Admits a Polynomial Kernel

Saket Saurabh, Jørgen Bang-Jensen, Kristine Vitting Klinkby, 2021, ESA.

On the inversion number of oriented graphs pdf

Jørgen Bang-Jensen, Frédéric Havet, Jonas Costa Ferreira da Silva, 2021, ArXiv.

Good orientations of unions of edge‐disjoint spanning trees

Jørgen Bang-Jensen, Matthias Kriesell, Stéphane Bessy, 2020, J. Graph Theory.

On Six Problems Posed by Jarik Nešetřil

Mathias Schacht, Jørgen Bang-Jensen, Bjarne Toft, 2006 .

Convex-round graphs are circular-perfect

Jørgen Bang-Jensen, Jing Huang, 2002 .

On the 2-Linkage Problem for Semicomplete Digraphs

Jørgen Bang-Jensen, J. Bang‐Jensen, J. Bang-Jensen, 1988 .

Paths , Trees and Cycles in Tournaments

Gregory Gutin, Jørgen Bang-Jensen, G. Gutin, 2003 .

A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation

Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling, 2010 .

Small degree out-branchings

Jørgen Bang-Jensen, Anders Yeo, Stéphan Thomassé, 2003 .

Feedback Sets and Vertex Orderings

Gregory Gutin, Jørgen Bang-Jensen, 2009 .

Sucient conditions for a digraph to be Hamiltonian

Gregory Gutin, Jørgen Bang-Jensen, 1996 .