The competition numbers of complete multipartite graphs with many partite sets

DOI10.1016/j.dam.2011.12.017zbMath1242.05110OpenAlexW2058751127MaRDI QIDQ423931

Suh-Ryung Kim, Yoshio Sano, Boram Park

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.017

zbMATH Keywords

complete multipartite graphscompetition graphscompetition numbers

Mathematics Subject Classification ID

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

Related Items (5)

A generalization of Opsut's lower bounds for the competition number of a graph ⋮ The competition number of a graph and the dimension of its hole space ⋮ The competition graphs of oriented complete bipartite graphs ⋮ Competition numbers and phylogeny numbers: uniform complete multipartite graphs ⋮ Competition numbers of complete \(r\)-partite graphs

Cites Work

• The competition numbers of complete tripartite graphs
• The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
• On the Computation of the Competition Number of a Graph
• Unnamed Item

This page was built for publication: The competition numbers of complete multipartite graphs with many partite sets