scientific article; zbMATH DE number 3606214
From MaRDI portal
Publication:4171826
zbMath0389.90036MaRDI QIDQ4171826
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Applications of graph theory to circuits and networks (94C15)
Related Items (55)
The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable ⋮ Inverting Signed Graphs ⋮ The competition-common enemy graph of a digraph ⋮ Competition hypergraphs ⋮ Any complete preference structure without circuit admits an interval representation ⋮ Competition numbers of graphs with a small number of triangles ⋮ Niche graphs ⋮ On CCE graphs of doubly partial orders ⋮ The (1,2)-step competition graph of a tournament ⋮ A sufficient condition for Kim's conjecture on the competition numbers of graphs ⋮ Edge-clique covers of the tensor product ⋮ Coopetition bunch graphs: competition and cooperation on COVID19 research ⋮ The competition numbers of complete multipartite graphs with many partite sets ⋮ The \(m\)-step competition graphs of doubly partial orders ⋮ The competition number of a graph and the dimension of its hole space ⋮ The competition number of the complement of a cycle ⋮ The competition hypergraphs of doubly partial orders ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ A generalization of Opsut's result on the competition numbers of line graphs ⋮ \((i,j)\) competition graphs ⋮ \(p\)-competition numbers ⋮ Competition numbers and phylogeny numbers: uniform complete multipartite graphs ⋮ Characterizations of competition multigraphs ⋮ Graphs having many holes but with small competition numbers ⋮ An upper bound for the competition numbers of graphs ⋮ 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 ⋮ The competition numbers of ternary Hamming graphs ⋮ Competition numbers of complete \(r\)-partite graphs ⋮ On Opsut's conjecture for hypercompetition numbers of hypergraphs ⋮ The elimination procedure for the competition number is not optimal ⋮ The competition number of a graph whose holes do not overlap much ⋮ Computing the boxicity of a graph by covering its complement by cointerval graphs ⋮ The competition numbers of complete tripartite graphs ⋮ Loop and cyclic niche graphs ⋮ \(p\)-competition graphs ⋮ Phylogeny numbers ⋮ The double competition number of some triangle-free graphs ⋮ Note on the \(m\)-step competition numbers of paths and cycles ⋮ The competition number of a graph with exactly \(h\) holes, all of which are independent ⋮ Applications of edge coverings by cliques ⋮ Bounds for the boxicity of Mycielski graphs ⋮ Competition polysemy ⋮ Phylogeny numbers for graphs with two triangles ⋮ A mathematical approach on representation of competitions: competition cluster hypergraphs ⋮ Phylogeny numbers of generalized Hamming graphs ⋮ The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares ⋮ The \(m\)-step competition graph of a digraph ⋮ The competition numbers of Johnson graphs with diameter four ⋮ A characterization of competition graphs ⋮ A characterization of graphs of competition number m ⋮ A characterization of competition graphs of arbitrary digraphs ⋮ On the Computation of the Competition Number of a Graph ⋮ The competition number of a graph having exactly one hole
This page was built for publication:
