Connectivity properties of locally semicomplete digraphs
Authors:
- 1 May 1994
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 18 (3) , 269-280
Abstract
It is shown that every k‐connected locally semicomplete digraph D with minimum outdegree at least 2k and minimum indegree at least 2k − 2 has at least m = max{2, k} vertices x1, x2, ⃛, xm such that D − xi is k‐connected for i = 1, 2, ⃛, m.Keywords
This publication has 6 references indexed in Scilit:
- Ecken von kleinem grad in kritisch n-fach zusammenhängenden digraphenJournal of Combinatorial Theory, Series B, 1991
- Locally semicomplete digraphs: A generalization of tournamentsJournal of Graph Theory, 1990
- Local tournaments and proper circular arc graphsLecture Notes in Computer Science, 1990
- Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphsJournal of Combinatorial Theory, Series B, 1989
- On Subtournaments of a TournamentCanadian Mathematical Bulletin, 1966
- Zur allgemeinen KurventheorieFundamenta Mathematicae, 1927