Strongly connectable digraphs and non-transitive dice
We give a new proof of the theorem of Boesch–Tindell and Farzad–Mahdian–Mahmoodian–Saberi–Sadri that a directed graph extends to a strongly connected digraph on the same vertex set if and only if it has no complete directed cut. Our proof bounds the number of edges needed for such an extension; we g...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-01-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.03.011 |