Transversals and competition numbers of complete multipartite graphs

DOI10.1016/J.DAM.2012.09.012zbMath1255.05088OpenAlexW2068845258MaRDI QIDQ1932466

Jaromy Scott Kuhl

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

zbMATH Keywords

Latin squaretransversalcompetition numbermultipartite complete graphcompetition acyclic digraph

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Niche hypergraphs ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ On the phylogeny graphs of degree-bounded digraphs ⋮ The partial order competition dimensions of bipartite graphs ⋮ A generalization of Opsut's result on the competition numbers of line graphs ⋮ Niche hypergraphs of products of digraphs

This page was built for publication: Transversals and competition numbers of complete multipartite graphs