51

Minimum cycle factors in quasi-transitive digraphs

Year:
2008
Language:
english
File:
PDF, 493 KB
english, 2008
53

Paths and cycles in extended and decomposable digraphs

Year:
1997
Language:
english
File:
PDF, 835 KB
english, 1997
54

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

Year:
1997
Language:
english
File:
PDF, 1.61 MB
english, 1997
55

A classification of locally semicomplete digraphs

Year:
1997
Language:
english
File:
PDF, 784 KB
english, 1997
56

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

Year:
1998
Language:
english
File:
PDF, 671 KB
english, 1998
57

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

Year:
2004
Language:
english
File:
PDF, 231 KB
english, 2004
58

Properly coloured Hamiltonian paths in edge-coloured complete graphs

Year:
1998
Language:
english
File:
PDF, 251 KB
english, 1998
59

A new sufficient condition for a digraph to be Hamiltonian

Year:
1999
Language:
english
File:
PDF, 126 KB
english, 1999
61

Problems concerning global connectivity of directed graphs

Year:
2000
Language:
english
File:
PDF, 261 KB
english, 2000
62

Cycles throughkvertices in bipartite tournaments

Year:
1994
Language:
english
File:
PDF, 208 KB
english, 1994
64

Decomposingk-ARc-Strong Tournaments Into Strong Spanning Subdigraphs

Year:
2004
Language:
english
File:
PDF, 287 KB
english, 2004
65

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

Year:
2011
Language:
english
File:
PDF, 372 KB
english, 2011
66

Augmenting hypergraphs by edges of size two

Year:
1999
Language:
english
File:
PDF, 120 KB
english, 1999
67

Heuristics for the central tree problem

Year:
2010
Language:
english
File:
PDF, 443 KB
english, 2010
68

The minimum spanning strong subdigraph problem is fixed parameter tractable

Year:
2008
Language:
english
File:
PDF, 243 KB
english, 2008
71

Disjoint sub(di)graphs in digraphs

Year:
2009
Language:
english
File:
PDF, 164 KB
english, 2009
72

Finding an induced subdivision of a digraph

Year:
2011
Language:
english
File:
PDF, 164 KB
english, 2011
73

Disjoint directed and undirected paths and cycles in digraphs

Year:
2009
Language:
english
File:
PDF, 690 KB
english, 2009
74

Complementary cycles containing prescribed vertices in tournaments

Year:
2000
Language:
english
File:
PDF, 196 KB
english, 2000
75

Convex-Round and Concave-Round Graphs

Year:
2000
Language:
english
File:
PDF, 207 KB
english, 2000
78

Finding an induced subdivision of a digraph

Year:
2012
Language:
english
File:
PDF, 371 KB
english, 2012
79

The Complexity of Colouring by Semicomplete Digraphs

Year:
1988
Language:
english
File:
PDF, 1.77 MB
english, 1988
84

Edge-Connectivity Augmentation Preserving Simplicity

Year:
1998
Language:
english
File:
PDF, 410 KB
english, 1998
86

[Springer Monographs in Mathematics] Digraphs || Connectivity of Digraphs

Year:
2009
Language:
english
File:
PDF, 740 KB
english, 2009
87

[Springer Monographs in Mathematics] Digraphs || Feedback Sets and Vertex Orderings

Year:
2009
Language:
english
File:
PDF, 678 KB
english, 2009
88

[Springer Monographs in Mathematics] Digraphs || Classes of Digraphs

Year:
2009
Language:
english
File:
PDF, 846 KB
english, 2009
89

[Springer Monographs in Mathematics] Digraphs || Distances

Year:
2009
Language:
english
File:
PDF, 715 KB
english, 2009
90

[Springer Monographs in Mathematics] Digraphs ||

Year:
2009
Language:
english
File:
PDF, 7.11 MB
english, 2009
92

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

Year:
2014
Language:
english
File:
PDF, 416 KB
english, 2014
93

Arc-disjoint paths and trees in 2-regular digraphs

Year:
2013
Language:
english
File:
PDF, 420 KB
english, 2013
94

(Arc-)disjoint flows in networks

Year:
2014
Language:
english
File:
PDF, 342 KB
english, 2014
99

Arc-Disjoint Paths in Decomposable Digraphs

Year:
2014
Language:
english
File:
PDF, 373 KB
english, 2014