Transversals and competition numbers of complete multipartite graphs
From MaRDI portal
Publication:1932466
DOI10.1016/j.dam.2012.09.012zbMath1255.05088MaRDI QIDQ1932466
Publication date: 18 January 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.09.012
Latin square; transversal; competition number; multipartite complete graph; competition acyclic digraph
05B15: Orthogonal arrays, Latin squares, Room squares
05C20: Directed graphs (digraphs), tournaments
Related Items
Niche hypergraphs, A generalization of Opsut's result on the competition numbers of line graphs, The partial order competition dimensions of bipartite graphs, Niche hypergraphs of products of digraphs, On \((1, 2)\)-step competition graphs of bipartite tournaments, On the phylogeny graphs of degree-bounded digraphs