A communication problem and directed triple systems
From MaRDI portal
Publication:1392553
DOI10.1016/S0166-218X(98)00028-6zbMath0902.05057WikidataQ127579744 ScholiaQ127579744MaRDI QIDQ1392553
András Gyárfás, Richard H. Schelp
Publication date: 2 December 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
Decomposition of bipartite graphs into special subgraphs, Terminal-pairability in complete bipartite graphs, Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs, The terminal-pairability problem in complete bipartite graphs
Cites Work