scientific article; zbMATH DE number 3606214

MaRDI QIDQ4171826zbMATH OpenFDO

Authors Fred Roberts

Publication date 1978

Mathematics Subject Classification ID

Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Applications of graph theory to circuits and networks (94C15)

Cited in

(58)

• The competition numbers of complete tripartite 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
• The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
• A characterization of competition graphs
• A characterization of graphs of competition number m
• A characterization of competition graphs of arbitrary digraphs
• The competition-common enemy graph of a digraph
• Niche graphs
• Representations of graphs and networks (coding, layouts and embeddings)
• \((i,j)\) competition graphs
• Phylogeny numbers
• Competition numbers of graphs with a small number of triangles
• Phylogeny numbers for graphs with two triangles
• The \(m\)-step competition graph of a digraph
• Connected triangle-free \(m\)-step competition graphs
• Loop and cyclic niche graphs
• \(p\)-competition graphs
• Competition polysemy
• Competition hypergraphs
• Any complete preference structure without circuit admits an interval representation
• Competition numbers and phylogeny numbers: uniform complete multipartite graphs
• Phylogeny numbers of generalized Hamming graphs
• The m-step competition graphs of doubly partial orders
• The competition number of the complement of a cycle
• The competition hypergraphs of doubly partial orders
• A class of acyclic digraphs with interval competition graphs
• The elimination procedure for the competition number is not optimal
• The competition number of a graph having exactly one hole
• The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
• Inverting Signed Graphs
• A sufficient condition for Kim's conjecture on the competition numbers of graphs
• The competition numbers of complete multipartite graphs with many partite sets
• The competition number of a graph and the dimension of its hole space
• Bounds for the boxicity of Mycielski graphs
• On the Computation of the Competition Number of a Graph
• A generalization of Opsut's result on the competition numbers of line graphs
• The competition numbers of Johnson graphs with diameter four
• Graphs having many holes but with small competition numbers
• The competition numbers of ternary Hamming graphs
• Computing the boxicity of a graph by covering its complement by cointerval graphs
• Coopetition bunch graphs: competition and cooperation on COVID19 research
• The (1,2)-step competition graph of a tournament
• The phylogeny number of a graph in the aspect of its triangles and diamonds
• A survey on the boxicity and cubicity of graphs
• p-competition numbers
• Competition numbers of complete \(r\)-partite graphs
• On Opsut's conjecture for hypercompetition numbers of hypergraphs
• Boxicity of zero divisor graphs
• The double competition number of some triangle-free graphs
• Applications of edge coverings by cliques
• A mathematical approach on representation of competitions: competition cluster hypergraphs
• On CCE graphs of doubly partial orders
• Edge-clique covers of the tensor product
• Characterizations of competition multigraphs
• An upper bound for the competition numbers of graphs
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• The competition number of a graph whose holes do not overlap much

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4171826)