Pages that link to "Item:Q1055445"
From MaRDI portal
The following pages link to A characterization of competition graphs of arbitrary digraphs (Q1055445):
Displaying 18 items.
- A generalization of Opsut's lower bounds for the competition number of a graph (Q367054) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Characterizations of competition multigraphs (Q967349) (← links)
- A characterization of competition graphs (Q1055443) (← links)
- A characterization of graphs of competition number m (Q1055444) (← 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)
- 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)
- A class of acyclic digraphs with interval competition graphs (Q2486750) (← links)
- Competition graphs of degree bounded digraphs (Q6180650) (← links)
