The following pages link to (Q3479858):
Displaying 46 items.
- On the competition graphs of \(d\)-partial orders (Q266800) (← links)
- The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable (Q266961) (← links)
- Niche hypergraphs (Q339464) (← links)
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity (Q405058) (← links)
- The competition number of a graph and the dimension of its hole space (Q427694) (← links)
- The (1,2)-step competition graph of a tournament (Q617643) (← links)
- Interval competition graphs of symmetric digraphs (Q688262) (← links)
- \(p\)-competition numbers (Q689960) (← links)
- On Opsut's conjecture for hypercompetition numbers of hypergraphs (Q713325) (← links)
- Upper bound multigraphs for posets (Q757442) (← links)
- Competition hypergraphs of products of digraphs (Q844216) (← links)
- On CCE graphs of doubly partial orders (Q881574) (← links)
- Products of digraphs and their competition graphs (Q907830) (← links)
- The competition graphs of oriented complete bipartite graphs (Q908307) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two (Q1023063) (← links)
- The competition number of a graph with exactly \(h\) holes, all of which are independent (Q1028099) (← links)
- \((i,j)\) competition graphs (Q1179189) (← links)
- Phylogeny numbers (Q1270783) (← links)
- Competition numbers of graphs with a small number of triangles (Q1377663) (← links)
- On the double competition number (Q1383383) (← links)
- Phylogeny numbers for graphs with two triangles (Q1570836) (← links)
- The \(m\)-step competition graph of a digraph (Q1582072) (← links)
- Connected triangle-free \(m\)-step competition graphs (Q1765515) (← links)
- Loop and cyclic niche graphs (Q1805299) (← links)
- \(p\)-competition graphs (Q1805319) (← links)
- Chromatic numbers of competition graphs (Q1805322) (← links)
- Competition hypergraphs (Q1887068) (← links)
- Niche space, multigraphs, and the Helly condition (Q1900301) (← links)
- A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive (Q1938687) (← links)
- Structural properties and hamiltonicity of neighborhood graphs (Q1959709) (← links)
- Competition graphs under complex Pythagorean fuzzy information (Q2053044) (← links)
- Oligopolistic competition among the wireless Internet service providers of Malaysia using fuzzy soft graphs (Q2143877) (← links)
- Competitively orientable complete multipartite graphs (Q2144500) (← links)
- On \(m\)-step competition graphs of bipartite tournaments (Q2192078) (← links)
- Measuring diversity in heterogeneous information networks (Q2227496) (← links)
- Niche hypergraphs of products of digraphs (Q2282480) (← links)
- The \(m\)-step competition graphs of doubly partial orders (Q2430029) (← links)
- On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected (Q2448228) (← links)
- The competition hypergraphs of doubly partial orders (Q2448902) (← links)
- A class of acyclic digraphs with interval competition graphs (Q2486750) (← 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)
- Subdivision Drawings of Hypergraphs (Q3611876) (← links)
- Subdivision of hypergraphs and their colorings (Q5106713) (← links)
- Competition graphs of degree bounded digraphs (Q6180650) (← links)
