Competition numbers of complete \(r\)-partite graphs
From MaRDI portal
Publication:713323
DOI10.1016/J.DAM.2012.05.005zbMath1252.05076OpenAlexW1981429672MaRDI QIDQ713323
Bo-Jun Li, Gerard Jennhwa Chang
Publication date: 26 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.005
Orthogonal arrays, Latin squares, Room squares (05B15) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Niche hypergraphs ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ On the phylogeny graphs of degree-bounded digraphs ⋮ The partial order competition dimensions of bipartite graphs ⋮ A generalization of Opsut's result on the competition numbers of line graphs ⋮ Competition numbers and phylogeny numbers: uniform complete multipartite graphs ⋮ Niche hypergraphs of products of digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of Opsut's lower bounds for the competition number of a graph
- The competition numbers of complete multipartite graphs with many partite sets
- The competition number of a graph with exactly two holes
- Graphs having many holes but with small competition numbers
- The competition numbers of ternary Hamming graphs
- The competition number of a graph whose holes do not overlap much
- The competition numbers of complete tripartite graphs
- The competition number of a graph with exactly \(h\) holes, all of which are independent
- The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
- A characterization of competition graphs
- Competition numbers of graphs with a small number of triangles
- The competition number of a graph having exactly one hole
- THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE
- On the Computation of the Competition Number of a Graph
This page was built for publication: Competition numbers of complete \(r\)-partite graphs
