The competition numbers of complete multipartite graphs with many partite sets
From MaRDI portal
(Redirected from Publication:423931)
Recommendations
- Competition numbers of complete \(r\)-partite graphs
- The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
- Transversals and competition numbers of complete multipartite graphs
- Competition numbers and phylogeny numbers: uniform complete multipartite graphs
- scientific article; zbMATH DE number 434915
Cites work
Cited in
(16)- p-competition numbers
- scientific article; zbMATH DE number 434915 (Why is no real title available?)
- Competitively tight graphs
- Competition numbers and phylogeny numbers: uniform complete multipartite graphs
- The competition numbers of complete tripartite graphs
- The competition number of a graph and the dimension of its hole space
- The competition numbers of regular polyhedra
- scientific article; zbMATH DE number 1154594 (Why is no real title available?)
- Competition numbers of complete \(r\)-partite graphs
- The competition graphs of oriented complete bipartite graphs
- scientific article; zbMATH DE number 7034396 (Why is no real title available?)
- A generalization of Opsut's lower bounds for the competition number of a graph
- Multicompetition numbers of some multigraphs.
- Transversals and competition numbers of complete multipartite graphs
- Competitively orientable complete multipartite graphs
- The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
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)