Competition numbers and phylogeny numbers: uniform complete multipartite graphs

DOI10.1007/s00373-019-02023-4zbMath1416.05127OpenAlexW2922274551WikidataQ128299311 ScholiaQ128299311MaRDI QIDQ2000559

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

zbMATH Keywords

mutually orthogonal Latin squaresedge clique cover

Mathematics Subject Classification ID

Hypergraphs (05C65) Orthogonal arrays, Latin squares, Room squares (05B15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Phylogeny numbers of generalized Hamming graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Niche hypergraphs
• The competition numbers of complete multipartite graphs with many partite sets
• Competition numbers of complete \(r\)-partite graphs
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• The competition numbers of complete tripartite graphs
• The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
• Phylogeny numbers
• Competition hypergraphs
• On the phylogeny graphs of degree-bounded digraphs
• On the Computation of the Competition Number of a Graph
• Competition Numbers and Phylogeny Numbers of Connected Graphs and Hypergraphs

This page was built for publication: Competition numbers and phylogeny numbers: uniform complete multipartite graphs