The competition numbers of complete multipartite graphs with many partite sets

DOI10.1016/J.DAM.2011.12.017zbMATH Open1242.05110OpenAlexW2058751127MaRDI QIDQ423931FDOQ423931

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

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

Cites Work

• Title not available (Why is that?)
• 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

Cited In (9)

• Title not available (Why is that?)
• \(p\)-competition numbers
• Competition numbers and phylogeny numbers: uniform complete multipartite graphs
• The competition number of a graph and the dimension of its hole space
• Title not available (Why is that?)
• Competition numbers of complete \(r\)-partite graphs
• The competition graphs of oriented complete bipartite graphs
• Title not available (Why is that?)
• A generalization of Opsut's lower bounds for the competition number of a graph

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

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