Competition numbers and phylogeny numbers: uniform complete multipartite graphs
DOI10.1007/S00373-019-02023-4zbMATH Open1416.05127OpenAlexW2922274551WikidataQ128299311 ScholiaQ128299311MaRDI QIDQ2000559FDOQ2000559
Soesoe Zaw, Yaokun Wu, Yanzhen Xiong
Publication date: 28 June 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-019-02023-4
Recommendations
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Orthogonal arrays, Latin squares, Room squares (05B15) Hypergraphs (05C65)
Cites Work
- The competition numbers of complete tripartite graphs
- Title not available (Why is that?)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- Competition hypergraphs
- Niche hypergraphs
- Competition numbers of complete \(r\)-partite graphs
- The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
- The competition numbers of complete multipartite graphs with many partite sets
- On the Computation of the Competition Number of a Graph
- Competition Numbers and Phylogeny Numbers of Connected Graphs and Hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Phylogeny numbers
- On the phylogeny graphs of degree-bounded digraphs
Cited In (4)
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)
