Pages that link to "Item:Q1003747"

The following pages link to The competition numbers of complete tripartite graphs (Q1003747):

Displaying 14 items.

• The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable (Q266961) (← links)
• A generalization of Opsut's lower bounds for the competition number of a graph (Q367054) (← links)
• The competition numbers of complete multipartite graphs with many partite sets (Q423931) (← links)
• The competition numbers of ternary Hamming graphs (Q548421) (← links)
• The (1,2)-step competition graph of a tournament (Q617643) (← links)
• Characterizing paths as \(m\)-step competition graphs (Q708427) (← links)
• Competition numbers of complete \(r\)-partite graphs (Q713323) (← links)
• The competition graphs of oriented complete bipartite graphs (Q908307) (← links)
• The competition number of a graph whose holes do not overlap much (Q987698) (← links)
• Note on the \(m\)-step competition numbers of paths and cycles (Q1026165) (← links)
• The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares (Q1045184) (← links)
• Competition numbers and phylogeny numbers: uniform complete multipartite graphs (Q2000559) (← links)
• The (1, 2)-step competition graph of a hypertournament (Q2053626) (← links)
• The competition number of the complement of a cycle (Q2446303) (← links)