Embedding tournaments in simple tournaments
From MaRDI portal
Publication:2552138
DOI10.1016/0012-365X(72)90016-7zbMath0236.05108MaRDI QIDQ2552138
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (20)
Tournaments, flags, and harmonic maps ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ Algorithmic and structural aspects of the \(P_3\)-Radon number ⋮ On the Carathéodory number of interval and graph convexities ⋮ Characterization and recognition of Radon-independent sets in split graphs ⋮ Decomposition of infinite labeled 2-structures ⋮ The convexity of induced paths of order three and applications: complexity aspects ⋮ An upper bound on the \(P_3\)-Radon number ⋮ On the contour of graphs ⋮ The Carathéodory number of the \(P_3\) convexity of chordal graphs ⋮ Graphs with few \(P_4\)'s under the convexity of paths of order three ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ Unnamed Item ⋮ Radon numbers for trees ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ Hull and geodetic numbers for some classes of oriented graphs ⋮ Making a tournament indecomposable by one subtournament-reversal operation ⋮ Some recollections on early work with Jan Pelant ⋮ SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES ⋮ On the Convexity of Paths of Length Two in Undirected Graphs
Cites Work
This page was built for publication: Embedding tournaments in simple tournaments
