A communication problem and directed triple systems

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

zbMATH Keywords

transitive triple systemsbalanced bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Decomposition of bipartite graphs into special subgraphs ⋮ The terminal-pairability problem in complete bipartite graphs ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ Terminal-pairability in complete bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Three-regular path pairable graphs
• The Analysis of Directed Triple Systems by Refinement
• Networks communicating for each pairing of terminals

This page was built for publication: A communication problem and directed triple systems