Pages that link to "Item:Q4750663"

The following pages link to On the Computation of the Competition Number of a Graph (Q4750663):

Displaying 40 items.

• 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 number of a graph and the dimension of its hole space (Q427694) (← links)
• The competition number of a graph with exactly two holes (Q434196) (← links)
• A generalization of Opsut's result on the competition numbers of line graphs (Q479034) (← links)
• Graphs having many holes but with small competition numbers (Q540279) (← links)
• The competition numbers of ternary Hamming graphs (Q548421) (← links)
• Competition numbers of complete \(r\)-partite graphs (Q713323) (← links)
• On Opsut's conjecture for hypercompetition numbers of hypergraphs (Q713325) (← links)
• Applications of edge coverings by cliques (Q762498) (← links)
• A mathematical approach on representation of competitions: competition cluster hypergraphs (Q778654) (← links)
• Edge-clique covers of the tensor product (Q897963) (← links)
• Characterizations of competition multigraphs (Q967349) (← links)
• An upper bound for the competition numbers of graphs (Q968122) (← links)
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
• The competition number of a graph whose holes do not overlap much (Q987698) (← links)
• The competition numbers of complete tripartite graphs (Q1003747) (← links)
• Note on the \(m\)-step competition numbers of paths and cycles (Q1026165) (← links)
• The competition number of a graph with exactly \(h\) holes, all of which are independent (Q1028099) (← links)
• The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares (Q1045184) (← links)
• A characterization of competition graphs (Q1055443) (← links)
• A characterization of graphs of competition number m (Q1055444) (← links)
• A characterization of competition graphs of arbitrary digraphs (Q1055445) (← links)
• Niche graphs (Q1123204) (← links)
• \((i,j)\) competition graphs (Q1179189) (← links)
• Phylogeny numbers (Q1270783) (← links)
• Competition numbers of graphs with a small number of triangles (Q1377663) (← links)
• The \(m\)-step competition graph of a digraph (Q1582072) (← links)
• Competition hypergraphs (Q1887068) (← links)
• Competition numbers and phylogeny numbers: uniform complete multipartite graphs (Q2000559) (← links)
• Phylogeny numbers of generalized Hamming graphs (Q2082421) (← links)
• Competitively tight graphs (Q2441380) (← links)
• The competition number of the complement of a cycle (Q2446303) (← links)
• The elimination procedure for the competition number is not optimal (Q2499585) (← links)
• The \(m\)-step, same-step, and any-step competition graphs (Q2576346) (← links)
• The competition number of a graph having exactly one hole (Q2576849) (← links)
• On the Competition Numbers of Diamond-Free Graphs (Q2958108) (← links)
• The competition numbers of Johnson graphs with diameter four (Q5006621) (← links)
• Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
• Competition graphs of degree bounded digraphs (Q6180650) (← links)