Pages that link to "Item:Q1055443"

The following pages link to A characterization of competition graphs (Q1055443):

Displaying 31 items.

• The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable (Q266961) (← links)
• The impact of initial evenness on biodiversity maintenance for a four-species \textit{in silico} bacterial community (Q304611) (← links)
• A generalization of Opsut's lower bounds for the competition number of a graph (Q367054) (← links)
• The (1,2)-step competition graph of a tournament (Q617643) (← links)
• Two-step graphs of trees (Q688263) (← links)
• Competition numbers of complete \(r\)-partite graphs (Q713323) (← links)
• Applications of edge coverings by cliques (Q762498) (← links)
• Characterizations of competition multigraphs (Q967349) (← links)
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
• The competition numbers of complete tripartite graphs (Q1003747) (← links)
• The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares (Q1045184) (← links)
• A characterization of graphs of competition number m (Q1055444) (← links)
• A characterization of competition graphs of arbitrary digraphs (Q1055445) (← links)
• The competition-common enemy graph of a digraph (Q1086581) (← 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)
• Loop and cyclic niche graphs (Q1805299) (← links)
• Tolerance competition graphs (Q1805304) (← links)
• \(p\)-competition graphs (Q1805319) (← links)
• Competition polysemy (Q1827753) (← links)
• Competition hypergraphs (Q1887068) (← links)
• Two-\(\phi\)-tolerance competition graphs (Q1917307) (← links)
• The Hamiltonicity on the competition graphs of round digraphs (Q2422588) (← links)
• A class of acyclic digraphs with interval competition graphs (Q2486750) (← links)
• The competition numbers of Johnson graphs with diameter four (Q5006621) (← links)
• Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
• Coopetition bunch graphs: competition and cooperation on COVID19 research (Q6125434) (← links)
• Competition graphs of degree bounded digraphs (Q6180650) (← links)