8 results on '"Jørgen Bang-Jensen"'
Search Results
2. Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs.
3. Convex-Round and Concave-Round Graphs.
4. Edge-Connectivity Augmentation with Partition Constraints.
5. Edge-Connectivity Augmentation Preserving Simplicity.
6. Preserving and Increasing Local Edge-Connectivity in Mixed Graphs.
7. A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs.
8. The Complexity of Colouring by Semicomplete Digraphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.