Competition numbers and phylogeny numbers: uniform complete multipartite graphs
From MaRDI portal
Publication:2000559
Recommendations
Cites work
- scientific article; zbMATH DE number 6473829 (Why is no real title available?)
- scientific article; zbMATH DE number 3162392 (Why is no real title available?)
- scientific article; zbMATH DE number 3606214 (Why is no real title available?)
- Competition hypergraphs
- Competition numbers and phylogeny numbers of connected graphs and hypergraphs
- Competition numbers of complete \(r\)-partite graphs
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- Niche hypergraphs
- On the Computation of the Competition Number of a Graph
- On the phylogeny graphs of degree-bounded digraphs
- Phylogeny numbers
- The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
- The competition numbers of complete multipartite graphs with many partite sets
- The competition numbers of complete tripartite graphs
Cited in
(8)- Note on competition and phylogeny numbers
- scientific article; zbMATH DE number 2192194 (Why is no real title available?)
- Competition numbers of complete \(r\)-partite graphs
- The phylogeny number of a graph in the aspect of its triangles and diamonds
- The competition numbers of complete multipartite graphs with many partite sets
- Transversals and competition numbers of complete multipartite graphs
- Competition numbers and phylogeny numbers of connected graphs and hypergraphs
- Phylogeny numbers of generalized Hamming graphs
This page was built for publication: Competition numbers and phylogeny numbers: uniform complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000559)