scientific article
From MaRDI portal
Publication:3479858
zbMath0701.92023MaRDI QIDQ3479858
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyopen problemscompetition graphs of food webscompetition-common enemy graphsgeneralized competition graphsinterval competition graphsniche graphs
Applications of graph theory (05C90) Ecology (92D40) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)
Related Items (46)
On the competition graphs of \(d\)-partial orders ⋮ The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable ⋮ Competition hypergraphs ⋮ Competition hypergraphs of products of digraphs ⋮ Oligopolistic competition among the wireless Internet service providers of Malaysia using fuzzy soft graphs ⋮ Competitively orientable complete multipartite graphs ⋮ Niche space, multigraphs, and the Helly condition ⋮ Niche hypergraphs ⋮ Competition numbers of graphs with a small number of triangles ⋮ On the double competition number ⋮ On CCE graphs of doubly partial orders ⋮ The (1,2)-step competition graph of a tournament ⋮ Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity ⋮ Subdivision of hypergraphs and their colorings ⋮ On \(m\)-step competition graphs of bipartite tournaments ⋮ A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive ⋮ Competition graphs of degree bounded digraphs ⋮ The \(m\)-step competition graphs of doubly partial orders ⋮ The competition number of a graph and the dimension of its hole space ⋮ Products of digraphs and their competition graphs ⋮ The competition graphs of oriented complete bipartite graphs ⋮ Structural properties and hamiltonicity of neighborhood graphs ⋮ On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected ⋮ The competition hypergraphs of doubly partial orders ⋮ Measuring diversity in heterogeneous information networks ⋮ \((i,j)\) competition graphs ⋮ Interval competition graphs of symmetric digraphs ⋮ \(p\)-competition numbers ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ A class of acyclic digraphs with interval competition graphs ⋮ Connected triangle-free \(m\)-step competition graphs ⋮ On Opsut's conjecture for hypercompetition numbers of hypergraphs ⋮ The elimination procedure for the competition number is not optimal ⋮ Niche hypergraphs of products of digraphs ⋮ Subdivision Drawings of Hypergraphs ⋮ Loop and cyclic niche graphs ⋮ \(p\)-competition graphs ⋮ Chromatic numbers of competition graphs ⋮ Competition graphs under complex Pythagorean fuzzy information ⋮ Phylogeny numbers ⋮ Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two ⋮ Upper bound multigraphs for posets ⋮ The competition number of a graph with exactly \(h\) holes, all of which are independent ⋮ Phylogeny numbers for graphs with two triangles ⋮ The \(m\)-step competition graph of a digraph ⋮ The competition number of a graph having exactly one hole
This page was built for publication:
