The competition numbers of complete tripartite graphs
From MaRDI portal
Publication:1003747
DOI10.1016/j.dam.2008.04.009zbMath1200.05173MaRDI 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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
The competition numbers of complete multipartite graphs with many partite sets, The competition numbers of ternary Hamming graphs, The (1,2)-step competition graph of a tournament, 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, 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