The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares

DOI10.1016/j.disc.2009.06.016zbMath1219.05063OpenAlexW2090981345MaRDI QIDQ1045184

Boram Park, Suh-Ryung Kim, Yoshio Sano

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.06.016

zbMATH Keywords

mutually orthogonal Latin squarescomplete multipartite graphcompetition graphcompetition numberedge clique cover number

Mathematics Subject Classification ID

Applications of graph theory (05C90) Orthogonal arrays, Latin squares, Room squares (05B15) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

A generalization of Opsut's lower bounds for the competition number of a graph ⋮ The competition numbers of complete multipartite graphs with many partite sets ⋮ The competition graphs of oriented complete bipartite graphs ⋮ The competition number of the complement of a cycle ⋮ Competition numbers and phylogeny numbers: uniform complete multipartite graphs ⋮ The competition numbers of ternary Hamming graphs ⋮ Competition numbers of complete \(r\)-partite graphs

Cites Work

• The competition numbers of complete tripartite graphs
• A characterization of competition graphs
• Competition numbers of graphs with a small number of triangles
• On the Computation of the Competition Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares