The competition numbers of complete tripartite graphs
From MaRDI portal
Publication:1003747
DOI10.1016/j.dam.2008.04.009zbMath1200.05173OpenAlexW1977736648MaRDI QIDQ1003747
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.04.009
Related Items (14)
The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable ⋮ A generalization of Opsut's lower bounds for the competition number of a graph ⋮ The (1,2)-step competition graph of a tournament ⋮ 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 ⋮ Characterizing paths as \(m\)-step competition graphs ⋮ Competition numbers of complete \(r\)-partite graphs ⋮ The competition number of a graph whose holes do not overlap much ⋮ The (1, 2)-step competition graph of a hypertournament ⋮ Note on the \(m\)-step competition numbers of paths and cycles ⋮ The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
Cites Work
This page was built for publication: The competition numbers of complete tripartite graphs
