Transversals and competition numbers of complete multipartite graphs

DOI10.1016/J.DAM.2012.09.012MaRDI QIDQ1932466zbMATH OpenOpenAlexFDO

Authors Jaromy 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

transversalLatin squarecompetition numbermultipartite complete graphcompetition acyclic digraph

Mathematics Subject Classification ID

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

Recommendations

• The competition numbers of complete multipartite graphs with many partite sets
• Competition numbers of complete \(r\)-partite graphs
• The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
• The competition numbers of complete tripartite graphs
• Competition numbers and phylogeny numbers: uniform complete multipartite graphs

Cited in

(12)

• On the phylogeny graphs of degree-bounded digraphs
• The competition numbers of complete tripartite graphs
• scientific article; zbMATH DE number 4187846 (Why is no real title available?)
• The competition numbers of Johnson graphs with diameter four
• On \((1, 2)\)-step competition graphs of bipartite tournaments
• Niche hypergraphs
• A generalization of Opsut's result on the competition numbers of line graphs
• Niche hypergraphs of products of digraphs
• Competition numbers of complete \(r\)-partite graphs
• The competition numbers of complete multipartite graphs with many partite sets
• The partial order competition dimensions of bipartite graphs
• The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932466)