Pages that link to "Item:Q1377663"

The following pages link to Competition numbers of graphs with a small number of triangles (Q1377663):

Displaying 22 items.

• A generalization of Opsut's lower bounds for the competition number of a graph (Q367054) (← 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)
• The competition numbers of ternary Hamming graphs (Q548421) (← links)
• Characterizing paths as \(m\)-step competition graphs (Q708427) (← links)
• Competition numbers of complete \(r\)-partite graphs (Q713323) (← links)
• The double competition number of some triangle-free graphs (Q757405) (← 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)
• Phylogeny numbers (Q1270783) (← links)
• Phylogeny numbers for graphs with two triangles (Q1570836) (← 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 competition number of a graph having exactly one hole (Q2576849) (← links)
• The elimination procedure for the competition number (Q2713639) (← links)
• On the inequality \(dk(G)\leq k(G)+1\) (Q2761055) (← links)
• The competition numbers of Johnson graphs (Q2997604) (← links)
• Competition graphs and clique dimensions (Q3977074) (← links)