The following pages link to Jörgen Bang-Jensen (Q558237):
Displaying 50 items.
- (Q290529) (redirect page) (← links)
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- The complexity of finding arc-disjoint branching flows (Q298947) (← links)
- (Q329277) (redirect page) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Antistrong digraphs (Q345072) (← links)
- The complexity of multicut and mixed multicut problems in (di)graphs (Q391767) (← links)
- Vertex-disjoint directed and undirected cycles in general digraphs (Q402588) (← links)
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs (Q414643) (← links)
- Arc-disjoint spanning sub(di)graphs in digraphs (Q441857) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs (Q558238) (← links)
- (Q685693) (redirect page) (← links)
- Maintenance of 2- and 3-edge-connected components of graphs. I (Q685694) (← links)
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- The core of a graph (Q686290) (← links)
- On the divisibility of the cycle number by 7 (Q687147) (← links)
- The complexity of colouring by locally semicomplete digraphs (Q709314) (← links)
- On the existence of (k,\(\ell)\)-kernels in digraphs (Q805626) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- The effect of two cycles on the complexity of colourings by directed graphs (Q911612) (← links)
- Minimum cycle factors in quasi-transitive digraphs (Q924641) (← links)
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs (Q967291) (← links)
- Spanning 2-strong tournaments in 3-strong semicomplete digraphs (Q968409) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- Disjoint directed and undirected paths and cycles in digraphs (Q1034635) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Edge-disjoint in- and out-branchings in tournaments and related path problems (Q1112061) (← links)
- On cyclic tournaments (Q1196291) (← links)
- Unsolved problems presented at the Julius Petersen graph theory conference (Q1197043) (← links)
- On the structure of locally semicomplete digraphs (Q1198647) (← links)
- Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments (Q1201912) (← links)
- Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Q1208466) (← links)
- Vertex deletion and cycles in multipartite tournaments (Q1292878) (← links)
- Pancyclicity of claw-free Hamiltonian graphs (Q1292881) (← links)
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397) (← links)
- Balanced cycles and holes in bipartite graphs (Q1297428) (← links)
- Augmenting hypergraphs by edges of size two (Q1300052) (← links)
- Successive edge-connectivity augmentation problems (Q1300062) (← links)
- On the complexity of hamiltonian path and cycle problems in certain classes of digraphs (Q1302144) (← links)
- A new sufficient condition for a digraph to be Hamiltonian (Q1302145) (← links)
- Partitioning graphs of bounded tree-width (Q1307308) (← links)
- In-tournament digraphs (Q1322037) (← links)
- On chordal proper circular arc graphs (Q1322203) (← links)
- The complexity of colouring symmetric relational systems (Q1327221) (← links)
- Cycles through \(k\) vertices in bipartite tournaments (Q1330800) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- On Kotzig's conjecture for graphs with a regular path-connectedness (Q1343281) (← links)
