AAAAAA

   
Results: 1-8 |
Results: 8
The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
Authors: Bang-Jensen, J Yeo, A
Citation: J. Bang-jensen et A. Yeo, The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs, J ALGORITHM, 41(1), 2001, pp. 1-19
Convex-round and concave-round graphs
Authors: Bang-Jensen, J Huang, J Yeo, A
Citation: J. Bang-jensen et al., Convex-round and concave-round graphs, SIAM J DISC, 13(2), 2000, pp. 179-193
Splitting off edges within a specified subset preserving the edge-connectivity of the graph
Authors: Bang-Jensen, J Jordan, T
Citation: J. Bang-jensen et T. Jordan, Splitting off edges within a specified subset preserving the edge-connectivity of the graph, J ALGORITHM, 37(2), 2000, pp. 326-343
On the complexity of hamiltonian path and cycle problems in certain classes of digraphs
Authors: Bang-Jensen, J Gutin, G
Citation: J. Bang-jensen et G. Gutin, On the complexity of hamiltonian path and cycle problems in certain classes of digraphs, DISCR APP M, 95(1-3), 1999, pp. 41-60
A new sufficient condition for a digraph to be Hamiltonian
Authors: Bang-Jensen, J Guo, YB Yeo, A
Citation: J. Bang-jensen et al., A new sufficient condition for a digraph to be Hamiltonian, DISCR APP M, 95(1-3), 1999, pp. 61-72
Edge-connectivity augmentation with partition constraints
Authors: Bang-Jensen, J Gabow, HN Jordan, T Szigeti, Z
Citation: J. Bang-jensen et al., Edge-connectivity augmentation with partition constraints, SIAM J DISC, 12(2), 1999, pp. 160-207
A note on vertex pancyclic oriented graphs
Authors: Bang-Jensen, J Guo, YB
Citation: J. Bang-jensen et Yb. Guo, A note on vertex pancyclic oriented graphs, J GRAPH TH, 31(4), 1999, pp. 313-318
Augmenting hypergraphs by edges of size two
Authors: Bang-Jensen, J Jackson, B
Citation: J. Bang-jensen et B. Jackson, Augmenting hypergraphs by edges of size two, MATH PROGR, 84(3), 1999, pp. 467-481
Risultati: 1-8 |