Výsledky vyhledávání - "Directed vertex-connectivity augmentation"

Making a tournament k $k$‐strong

Autoři: Jørgen Bang‐Jensen Kasper S. Johansen Anders Yeo

Zdroj: Bang-Jensen, J, Johansen, K S & Yeo, A 2023, ' Making a tournament k-strong ', Journal of Graph Theory, vol. 103, no. 1, pp. 5-11 . https://doi.org/10.1002/jgt.22900

Témata: Semicomplete digraph, Directed vertex-connectivity augmentation, directed vertex-connectivity augmentation, One-way pairs, one-way pairs, increasing connectivity, 0102 computer and information sciences, semicomplete digraph, Increasing connectivity, Tournament, 01 natural sciences, tournament

Popis souboru: application/pdf

Přístupová URL adresa: https://orbit.dtu.dk/en/publications/e7a6ce88-db15-46cf-b4d6-d29c5b31ba09
https://portal.findresearcher.sdu.dk/da/publications/3efd6bbd-43c7-4172-8470-39227bd099e6
https://doi.org/10.1002/jgt.22900

Making a tournament k-strong

Autoři: Bang-Jensen, Jørgen Johansen, Kasper S. Yeo, Anders

Zdroj: Bang-Jensen , J , Johansen , K S & Yeo , A 2023 , ' Making a tournament k -strong ' , Journal of Graph Theory , vol. 103 , no. 1 , pp. 5-11 .

Témata: Directed vertex-connectivity augmentation, Increasing connectivity, One-way pairs, Semicomplete digraph, Tournament, article

URL: https://orbit.dtu.dk/en/publications/e7a6ce88-db15-46cf-b4d6-d29c5b31ba09
https://doi.org/10.1002/jgt.22900
https://backend.orbit.dtu.dk/ws/files/316130758/Journal_of_Graph_Theory_2022_Bang_Jensen_Making_a_tournament_k_k_strong.pdf