347 results on '"Jørgen Bang-Jensen"'
Search Results
102. The Complexity of Finding Low Chromatic Spanning Sub(Di)Graphs with Prescribed Connectivity Properties1
103. Subgraphs in vertex neighborhoods of Kr-free graphs.
104. Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments.
105. Splitting off edges between two subsets preserving the edge-connectivity of the graph.
106. The structure of strong arc-locally semicomplete digraphs.
107. Making a tournament k-arc-strong by reversing or deorienting arcs.
108. When the greedy algorithm fails.
109. Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs.
110. Steiner type problems for digraphs that are locally semicomplete or extended semicomplete.
111. Small degree out-branchings.
112. Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs.
113. Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs.
114. DAG-width and circumference of digraphs.
115. Completing orientations of partially oriented graphs.
116. Convex-round graphs are circular-perfect.
117. Eulerian trails through a set of terminals in specific, unique and all orders.
118. Making a tournament k-arc-strong by reversing arcs.
119. The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.
120. Local Tournaments and Proper Circular Arc Gaphs.
121. Complementary cycles containing prescribed vertices in tournaments.
122. Problems concerning global connectivity of directed graphs.
123. Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph.
124. Convex-Round and Concave-Round Graphs.
125. A note on vertex pancyclic oriented graphs.
126. Linkages in locally semicomplete digraphs and quasi-transitive digraphs.
127. On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.
128. A New Sufficient Condition for a Digraph to Be Hamiltonian.
129. Augmenting hypergraphs by edges of size two.
130. Edge-Connectivity Augmentation with Partition Constraints.
131. Generalizations of tournaments: A survey.
132. A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs.
133. Kings in quasi-transitive digraphs.
134. Alternating cycles and trails in 2-edge-coloured complete multigraphs.
135. Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs.
136. Adding and Reversing Arcs in Semicomplete Digraphs.
137. Edge-Connectivity Augmentation Preserving Simplicity.
138. Alternating cycles and paths in edge-coloured multigraphs: A survey.
139. A classification of locally semicomplete digraphs.
140. Paths and cycles in extended and decomposable digraphs, .
141. Vertex heaviest paths and cycles in quasi-transitive digraphs.
142. Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments.
143. Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.
144. Sufficient conditions for a digraph to be Hamiltonian.
145. Weakly Hamiltonian-connected locally semicomplete digraphs.
146. A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian.
147. On k-strong and k-cyclic digraphs.
148. Finding an induced subdivision of a digraph.
149. Quasi-transitive digraphs.
150. Digraphs with the path-merging property.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.