A characterization of competition graphs
From MaRDI portal
Publication:1055443
DOI10.1016/0166-218X(83)90085-9zbMath0521.05057MaRDI QIDQ1055443
Robert C. Brigham, Ronald D. Dutton
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable, The competition-common enemy graph of a digraph, Competition hypergraphs, The impact of initial evenness on biodiversity maintenance for a four-species \textit{in silico} bacterial community, Two-\(\phi\)-tolerance competition graphs, A generalization of Opsut's lower bounds for the competition number of a graph, Competition numbers of graphs with a small number of triangles, Niche graphs, The (1,2)-step competition graph of a tournament, The Hamiltonicity on the competition graphs of round digraphs, Coopetition bunch graphs: competition and cooperation on COVID19 research, Competition graphs of degree bounded digraphs, \((i,j)\) competition graphs, Two-step graphs of trees, Characterizations of competition multigraphs, Dimension-2 poset competition numbers and dimension-2 poset double competition numbers, A class of acyclic digraphs with interval competition graphs, Competition numbers of complete \(r\)-partite graphs, The competition numbers of complete tripartite graphs, Loop and cyclic niche graphs, Tolerance competition graphs, \(p\)-competition graphs, Phylogeny numbers, Applications of edge coverings by cliques, Competition polysemy, 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 graphs of competition number m, A characterization of competition graphs of arbitrary digraphs, Partial Characterizations of 1‐Perfectly Orientable Graphs
Cites Work
